Core Concepts
Decorated Reeb spaces are Gromov-Hausdorff stable and can be approximated from finite samples.
Abstract
The content discusses stability and approximations for Decorated Reeb Spaces, focusing on the core concept of Gromov-Hausdorff stability. It introduces the concept of decorated Reeb spaces, their construction, and computational framework. The article provides insights into graphical summaries of topological spaces, persistent homology, and methods for enriching graphical descriptors with additional geometric or topological data. It also covers the metrization of Reeb spaces, decorations using persistence diagrams, and stability results for enriched topological summaries.
Introduction:
Graphical summaries in mathematics.
Popular tools for shape and data analysis.
Enriching graphical descriptors with geometric or topological data.
Stability and Approximations:
Introducing decorated Reeb spaces.
Construction methods and computational frameworks.
Metrization of Reeb spaces.
Decorations using persistence diagrams.
Stability results for enriched topological summaries.
Gromov-Hausdorff Stability:
Metric fields and multiscale comparisons.
Connectivity conditions for metric fields.
Stability properties of decorated Reeb space constructions.
Finite Approximations:
Approximating decorated Reeb spaces from finite samples.
Algorithm for computing the Reeb radius function.
Stability results for barcode decorations in discrete settings.
Simplifying Graphs by Smoothing:
Adapting the concept of Reeb smoothing to combinatorial graphs.
Effectiveness of ϵ-smoothings in simplifying graph structures.
Computational Examples:
Synthetic data examples illustrating the effect of the λ parameter on DRGs.
Shape data examples showcasing different functions applied to DRGs.
Stats
Given a map f : X → M from a topological space X to a metric space M...