Categorified Reeb graphs
From MaRDI portal
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.
Recommendations
- Categorial graphs
- CATEGORIFICATION VIA EQUIPPED GRAPHS
- Categorical constructions in graph theory
- scientific article; zbMATH DE number 26780
- Categoricity and topological graphs
- scientific article; zbMATH DE number 4105024
- scientific article; zbMATH DE number 4065048
- Hypergraph categories
- Group-theoretical graph categories
- Graphs realised by r.e. equivalence relations
Cites work
- scientific article; zbMATH DE number 3129899 (Why is no real title available?)
- scientific article; zbMATH DE number 3940199 (Why is no real title available?)
- scientific article; zbMATH DE number 47944 (Why is no real title available?)
- scientific article; zbMATH DE number 3476271 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 2079726 (Why is no real title available?)
- scientific article; zbMATH DE number 753667 (Why is no real title available?)
- scientific article; zbMATH DE number 3106699 (Why is no real title available?)
- A categorical approach to contour, split and join trees with application to airway segmentation
- A data structure for dynamic trees
- A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- An efficient computation of handle and tunnel loops via Reeb graphs
- Branched and folded coverings
- Categorification of persistent homology
- Computing contour trees in all dimensions
- Dynamizing static algorithms, with applications to dynamic trees and history independence
- Efficient Output-Sensitive Construction of Reeb Graphs
- Exit paths and constructible stacks
- Extending persistence using Poincaré and Lefschetz duality
- Extreme elevation on a 2-manifold
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- Loops in Reeb graphs of 2-manifolds
- Maintaining information in fully dynamic trees with top trees
- Measuring distance between Reeb graphs (extended abstract)
- Metrics for generalized persistence modules
- Notes on topological stability
- Parallel computation of the topology of level sets
- Proximity of persistence modules and their diagrams
- Reeb graphs for shape analysis and applications
- Reeb spaces of piecewise linear mappings
- Self-adjusting binary search trees
- Self-adjusting top trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- Stability of persistence diagrams
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- The edit distance for Reeb graphs of surfaces
- The fundamental category of a stratified space
- Topological persistence for circle-valued maps
- Zigzag persistent homology and real-valued functions
Cited in
(38)- Classification of Constructible Cosheaves
- Statistical analysis and parameter selection for Mapper
- Parametrized homology via zigzag persistence
- Structure and stability of the one-dimensional Mapper
- Spatiotemporal persistent homology for dynamic metric spaces
- Algebraic stability of zigzag persistence modules
- Local equivalence and intrinsic metrics between Reeb graphs
- Metric spaces with expensive distances
- Reeb graphs of piecewise linear functions
- Statistics for data with geometric structure. Abstracts from the workshop held January 21--27, 2018
- Analysis of dynamic graphs and dynamic metric spaces via zigzag persistence
- Regularity via links and Stein factorization
- Realizable piecewise linear paths of persistence diagrams with Reeb graphs
- The theory of the interleaving distance on multidimensional persistence modules
- Exact weights, path metrics, and algebraic Wasserstein distances
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- Computing bottleneck distance for 2-D interval decomposable modules
- Generalized persistence diagrams
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- Dualities between cellular sheaves and cosheaves
- Moduli spaces of Morse functions for persistence
- Topological spaces of persistence modules and their properties
- Combinatorial persistent homology transform
- Discrete Morse theory for computing cellular sheaf cohomology
- On the Reeb spaces of definable maps
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- The Reeb graph edit distance is universal
- Multivariate topology simplification
- Universal distances for extended persistence
- Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
- On the stability of interval decomposable persistence modules
- Theory of interleavings on categories with a flow
- Generalized persistence diagrams for persistence modules over posets
- Persistence diagrams as diagrams: a categorification of the stability theorem
- Decorated merge trees for persistent topology
- Statistical analysis of Mapper for stochastic and multivariate filters
- Labeled interleaving distance for Reeb graphs
- Probabilistic convergence and stability of random mapper graphs
This page was built for publication: Categorified Reeb graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309649)
