Categorified Reeb Graphs

Abstract

The Reeb graph is a construction which originated in Morse theory to study a real valued function defined on a topological space. More recently, it has been used in various applications to study noisy data which creates a desire to define a measure of similarity between these structures. Here, we exploit the fact that the category of Reeb graphs is equivalent to the category of a particular class of cosheaf. Using this equivalency, we can define an `interleaving' distance between Reeb graphs which is stable under the perturbation of a function. Along the way, we obtain a natural construction for smoothing a Reeb graph to reduce its topological complexity. The smoothed Reeb graph can be constructed in polynomial time.

References in corpus (1)

• Topological Methods for Exploring Low-density States in Biomolecular Folding Pathways

Cited by in corpus (23)

• Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
• Generalized Persistence Diagrams
• Algebraic Stability of Zigzag Persistence Modules
• A Structural Average of Labeled Merge Trees for Uncertainty Visualization
• Structure and Stability of the 1-Dimensional Mapper
• Generalized Persistence Diagrams for Persistence Modules over Posets
• Probabilistic Convergence and Stability of Random Mapper Graphs
• Spatio-temporal Persistent Homology for Dynamic Metric Spaces
• The ${\ell }^{\infty }$-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance
• Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
• Topological spaces of persistence modules and their properties
• The Reeb Graph Edit Distance is Universal
• A Deformation-based Edit Distance for Merge Trees
• Parametrized Homology via Zigzag Persistence
• Moduli Spaces of Morse Functions for Persistence
• Computing a Stable Distance on Merge Trees
• Intrinsic Interleaving Distance for Merge Trees
• Exact weights, path metrics, and algebraic Wasserstein distances
• Flexible and Probabilistic Topology Tracking with Partial Optimal Transport
• Poincaré-Reeb graphs of real algebraic domains
• Universal Distances for Extended Persistence
• Regularity via Links and Stein Factorization
• Bounding the Interleaving Distance for Mapper Graphs with a Loss Function