Quantitative simplification of filtered simplicial complexes
From MaRDI portal
Publication:2225664
DOI10.1007/S00454-019-00104-YzbMATH Open1460.55024arXiv1801.02812OpenAlexW2964236818WikidataQ127768878 ScholiaQ127768878MaRDI QIDQ2225664FDOQ2225664
Authors: Facundo Mémoli, Osman Berat Okutan 
Publication date: 10 February 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1801.02812
Recommendations
Persistent homology and applications, topological data analysis (55N31) Simplicial sets and complexes in algebraic topology (55U10)
Cites Work
- The structure and stability of persistence modules
- Topology and data
- Computational topology. An introduction
- Title not available (Why is that?)
- Computing persistent homology
- Topological persistence and simplification
- A course in metric geometry
- Title not available (Why is that?)
- The tidy set, a minimal simplicial set for computing homology of clique complexes
- Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold
- Categorification of persistent homology
- Persistence stability for geometric complexes
- Strong equivalence of the interleaving and functional distortion metrics for Reeb graphs
- The Vietoris-Rips complexes of a circle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong homotopy types, nerves and collapses
- Computing topological persistence for simplicial maps (extended abstract)
- Induced matchings of barcodes and the algebraic stability of persistence
- The theory of the interleaving distance on multidimensional persistence modules
- Approximating persistent homology in Euclidean space through collapses
- A functorial Dowker theorem and persistent homology of asymmetric networks
- Measuring the distance between merge trees
- Multiscale mapper: topological summarization via codomain covers
- Visualizing Sparse Filtrations.
- Approximate Čech Complex in Low and High Dimensions
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch-collapse
- Quantitative homotopy theory in topological data analysis
- Vietoris-Rips and Čech complexes of metric gluings
Cited In (11)
- Topological graph persistence
- Alpha magnitude
- Quantifying the structural stability of simplicial homology
- Quantitative homotopy theory in topological data analysis
- 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
- Vietoris-Rips persistent homology, injective metric spaces, and the filling radius
- Decomposing filtered chain complexes: geometry behind barcoding algorithms
- The persistent topology of optimal transport based metric thickenings
Uses Software
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)
