Persistent Homology Lower Bounds on High-Order Network Distances

DOI10.1109/TSP.2016.2620963MaRDI QIDQ4620538zbMATH OpenOpenAlexFDO

Authors Weiyu Huang, Alejandro Ribeiro

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.03044

Mathematics Subject Classification ID

Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the number of nodes is large. 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 complexes and showing that the distance between networks can be lower bounded by the difference between the homological features of their respective filtrations. Practical implications are explored by classifying weighted pairwise networks constructed from different gener- ative processes and by comparing the coauthorship networks of engineering and mathematics academic journals. The persistent homology methods succeed in identifying different generative models, in discriminating engineering and mathematics commu- nities, as well as in differentiating engineering communities with different research interests.

Recommendations

• Persistent homology of complex networks
• Persistent path homology of directed networks
• The persistent homology of distance functions under random projection
• Persistent homology of vertex-weighted digraphs
• Forman-Ricci curvature and persistent homology of unweighted complex networks
• Dimensionality reduction for \(k\)-distance applied to persistent homology
• Dimensionality Reduction for k-Distance Applied to Persistent Homology
• Persistent homology of collaboration networks
• Persistent homology for low-complexity models
• A functorial Dowker theorem and persistent homology of asymmetric networks

Cited in

(4)

• The Gromov–Wasserstein distance between networks and stable network invariants
• Persistent homology with k-nearest-neighbor filtrations reveals topological convergence of PageRank
• Persistent homology of hypergraphs via barycentric subdivision
• Topological graph persistence

This page was built for publication: Persistent Homology Lower Bounds on High-Order Network Distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620538)