Quantitative simplification of filtered simplicial complexes
From MaRDI portal
Abstract: We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving type of distance between fitered simplicial complexes. We study the special case of Vietoris-Rips filtrations and show that our bounds offer a significant improvement over the immediate bounds coming from considerations related to the Gromov-Hausdorff distance. Based on these ideas we give an iterative method for the practical simplification of filtered simplicial complexes. As a byproduct of our analysis we identify a notion of core of a filtered simplicial complex which admits the interpretation as a minimalistic simplicial filtration which retains all the persistent homology information.
Recommendations
Cites work
- scientific article; zbMATH DE number 5704228 (Why is no real title available?)
- scientific article; zbMATH DE number 1344784 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3102166 (Why is no real title available?)
- A course in metric geometry
- A functorial Dowker theorem and persistent homology of asymmetric networks
- Approximate Čech Complex in Low and High Dimensions
- Approximating persistent homology in Euclidean space through collapses
- Categorification of persistent homology
- Computational topology. An introduction
- Computing persistent homology
- Computing topological persistence for simplicial maps (extended abstract)
- Induced matchings of barcodes and the algebraic stability of persistence
- Measuring the distance between merge trees
- Multiscale mapper: topological summarization via codomain covers
- Persistence stability for geometric complexes
- Quantitative homotopy theory in topological data analysis
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch-collapse
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- Strong homotopy types, nerves and collapses
- The Vietoris-Rips complexes of a circle
- The structure and stability of persistence modules
- The theory of the interleaving distance on multidimensional persistence modules
- The tidy set, a minimal simplicial set for computing homology of clique complexes
- Topological persistence and simplification
- Topology and data
- Vietoris-Rips and Čech complexes of metric gluings
- Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold
- Visualizing Sparse Filtrations.
Cited in
(12)- The persistent topology of optimal transport based metric thickenings
- Topological graph persistence
- Alpha magnitude
- Quantitative homotopy theory in topological data analysis
- Quantifying the structural stability of simplicial homology
- The tidy set, a minimal simplicial set for computing homology of clique complexes
- The Persistent Homology of Cyclic Graphs
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- Ephemeral persistence features and the stability of filtered chain complexes
- New families of stable simplicial filtration functors
- Vietoris-Rips persistent homology, injective metric spaces, and the filling radius
- Decomposing filtered chain complexes: geometry behind barcoding algorithms
This page was built for publication: Quantitative simplification of filtered simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225664)
