The relationship between the intrinsic Čech and persistence distortion distances for metric graphs

DOI10.20382/JOCG.V10I1A16zbMATH Open1476.55015arXiv1812.05282OpenAlexW3046423622MaRDI QIDQ5213191FDOQ5213191

Authors: Ellen Gasparovic, Maria Gommel, Emilie Purvine, R. Sazdanović, Bei Wang, Yusu Wang, Lori Ziegelmeier 

Publication date: 31 January 2020

Abstract: Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric graphs in the context of comparison, we are interested in determining the relative discriminative capabilities of two topology-based distances between a pair of arbitrary finite metric graphs: the persistence distortion distance and the intrinsic Cech distance. We explicitly show how to compute the intrinsic Cech distance between two metric graphs based solely on knowledge of the shortest systems of loops for the graphs. Our main theorem establishes an inequality between the intrinsic Cech and persistence distortion distances in the case when one of the graphs is a bouquet graph and the other is arbitrary. The relationship also holds when both graphs are constructed via wedge sums of cycles and edges.

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

Recommendations

• Comparing Graphs via Persistence Distortion
• A complete characterization of the one-dimensional intrinsic Čech persistence diagrams for metric graphs
• Distances between immersed graphs: metric properties
• Local equivalence and intrinsic metrics between Reeb graphs
• Barcode embeddings for metric graphs

zbMATH Keywords

metric graphspersistence diagramsextended persistenceintrinsic Čech distancepersistence distortion distance

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)

Cited In (4)

• Barcode embeddings for metric graphs
• Title not available (Why is that?)
• Local equivalence and intrinsic metrics between Reeb graphs
• A complete characterization of the one-dimensional intrinsic Čech persistence diagrams for metric graphs

This page was built for publication: The relationship between the intrinsic Čech and persistence distortion distances for metric graphs

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