Reeb Graph Metrics from the Ground Up

Abstract

The Reeb graph has been utilized in various applications including the analysis of scalar fields. Recently, research has been focused on using topological signatures such as the Reeb graph to compare multiple scalar fields by defining distance metrics on the topological signatures themselves. Here we survey five existing metrics that have been defined on Reeb graphs: the bottleneck distance, the interleaving distance, functional distortion distance, the Reeb graph edit distance, and the universal edit distance. Our goal is to (1) provide definitions and concrete examples of these distances in order to develop the intuition of the reader, (2) visit previously proven results of stability, universality, and discriminativity, (3) identify and complete any remaining properties which have only been proven (or disproven) for a subset of these metrics, (4) expand the taxonomy of the bottleneck distance to better distinguish between variations which have been commonly miscited, and (5) reconcile the various definitions and requirements on the underlying spaces for these metrics to be defined and properties to be proven.

arXiv comment71 pages, 35 figures

References in corpus (13)

• The Theory of the Interleaving Distance on Multidimensional Persistence Modules
• Metrics for generalized persistence modules
• Sheaves, Cosheaves and Applications
• Algebraic Stability of Zigzag Persistence Modules
• Edit Distance between Merge Trees
• A Structural Average of Labeled Merge Trees for Uncertainty Visualization
• Probabilistic Convergence and Stability of Random Mapper Graphs
• Stability of higher-dimensional interval decomposable persistence modules
• The ${\ell }^{\infty }$-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance
• Interleaving and Gromov-Hausdorff distance
• New Techniques for Graph Edit Distance Computation
• A Relative Theory of Interleavings
• Metric Limits in Categories with a Flow