Quantitative simplification of filtered simplicial complexes

DOI10.1007/S00454-019-00104-YMaRDI QIDQ2225664zbMATH OpenOpenAlexWikidataFDO

Authors Facundo Mémoli, Osman Berat Okutan

Publication date 10 February 2021

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.02812

zbMATH Keywords

filtrationinterleavingpersistence

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Simplicial sets and complexes in algebraic topology (55U10)

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.

Review text

Filtered simplicial complexes arise in many areas of algebraic topology, and are particularly prevalent in topological data analysis, where they give information about complex data sets by means of the persistent homology associated to a filtered complex, which is algorithmically generated from the data. A major issue in topological data analysis is clearly computability of persistent homology of large filtered simplicial complexes. This paper introduces a new invariant of filtered simplicial complexes called codensity, which controls the effect of removing a vertex and all simplices containing it from a filtered simplicial complex on persistent homology. The paper also introduces an interleaving type pseudo-distance function \(d_I^F\) for filtered simplicial complexes. The authors prove a stability theorem for this pseudo-metric, and use it to define vertex codensity which allows them to obtain an upper bound on the distance between a filtered complex \(X^*\) and the same complex with a vertex removed. Finally, the paper shows for any filtered finite simplicial complex, there exists a full subcomplex \(C^*\) that is minimal in the appropriate sense and is unique up to isomorphism, such that \(d_I^F(X^*, C^*)=0\).

Recommendations

• Simplification of complexes for persistent homology computations
• Topological persistence and simplification
• Persistence stability for geometric complexes

Cites work

• 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)
• 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?)
• 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 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
• The Vietoris-Rips complexes of a circle
• 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

(13)

• Decomposing filtered chain complexes: geometry behind barcoding algorithms
• New families of stable simplicial filtration functors
• Quantitative homotopy theory in topological data analysis
• The Persistent Homology of Cyclic Graphs
• The tidy set, a minimal simplicial set for computing homology of clique complexes
• Alpha magnitude
• The persistent topology of optimal transport based metric thickenings
• Quantifying the structural stability of simplicial homology
• Vietoris-Rips persistent homology, injective metric spaces, and the filling radius
• Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
• Ephemeral persistence features and the stability of filtered chain complexes
• Combinatorial topological models for phylogenetic networks and the mergegram invariant
• Topological graph persistence

Describes a project that uses

Uses Software

• SimBa

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)