Persistent Homology with Path-Representable Distances on Graph Data
Eunwoo Heo, Byeongchan Choi, Jae-Hun Jung

TL;DR
This paper explores how different path-representable distances on graphs influence persistent homology, introduces the total persistence difference as a new measure, and demonstrates its stability and effectiveness in analyzing graph data.
Contribution
It defines path-representable distances, establishes relationships between their persistent homologies, and introduces TPD as a new stable topological measure for graph analysis.
Findings
Injection between 1D barcodes for unweighted and weighted shortest-path distances
TPD effectively captures patterns and trends in graph data
TPD shows stronger correlation with classical graph statistics than existing measures
Abstract
Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their interpretations. In this paper, we define a class of distances on graphs, called path-representable distances, and investigate structural relationships between their induced persistent homologies. In particular, we identify a nontrivial injection between the 1-dimensional barcodes induced by two commonly used graph distances: the unweighted and weighted shortest-path distances. We formally establish sufficient conditions under which such embeddings arise, focusing on a subclass we call cost-dominated distances. The injection property is shown to hold in 0- and 1-dimensions, while we provide counterexamples for higher-dimensional cases. To make these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis
