The Relationship Between the Intrinsic Cech and Persistence Distortion Distances for Metric Graphs

12/13/2018
by   Ellen Gasparovic, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2019

Local Versus Global Distances for Zigzag Persistence Modules

This short note establishes explicit and broadly applicable relationship...
research
12/11/2020

Intrinsic persistent homology via density-based metric learning

We address the problem of estimating intrinsic distances in a manifold f...
research
02/22/2018

Near Isometric Terminal Embeddings for Doubling Metrics

Given a metric space (X,d), a set of terminals K⊆ X, and a parameter t> ...
research
05/24/2018

A derived isometry theorem for constructible sheaves on R

Following Curry and Kashiwara Schapira seminal works on adapting persist...
research
09/21/2019

Efficient estimation of a Gromov--Hausdorff distance between unweighted graphs

Gromov--Hausdorff distances measure shape difference between the objects...
research
01/12/2018

A Family of Tractable Graph Distances

Important data mining problems such as nearest-neighbor search and clust...
research
04/30/2018

A Data-Dependent Distance for Regression

We develop a new data-dependent distance for regression problems to comp...

Please sign up or login with your details

Forgot password? Click here to reset