Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Persistent Homology Lower Bounds on. High Order Network Distances. Weiyu Huang and Alejandro Ribeiro. Abstract—This paper presents methods to compare high order.
Abstract: High order networks are weighted complete hypergraphs collecting relationships between elements of tuples. Valid metric distances between high ...
Jul 10, 2015 · Abstract:High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs.
The paper does so by mapping high-order networks to filtrations of simplicial complexes and showing that the distance between networks can be lower bounded ...
Abstract—High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances ...
People also ask
PDF | This paper presents methods to compare high order networks using persistent homology. High order networks are weighted complete hypergraphs.
The goal here is to find tractable approximations of these network distances. The paper does so by mapping high-order networks to filtrations of simplicial ...
Aug 23, 2019 · They show that they can lower bound distance between two higher order networks ... Huang, W, Ribeiro A (2017) Persistent homology lower bounds on ...
Persistent homology lower bounds on distances in the space of networks · Persistent Homology Lower Bounds on High-Order Network Distances · Metrics in the space ...