Singular persistent homology with geometrically parallelizable computation
From MaRDI portal
Abstract: Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in machine learning, it needs to be effectively computable. Classical homology is a computable topological invariant because of the Mayer-Vietoris exact and spectral sequences associated to coverings of a space. We state and prove versions of the Mayer-Vietoris theorem for persistent homology under mild and commonplace assumptions. This is done through the use of a new theory, the singular persistent homology, better suited for handling coverings of data sets. As an application, we create a distributed computational workflow where the advantage is not only or even primarily in speed improvement but in sheer feasibility for large data sets.
Recommendations
- Distributed computation of persistent homology
- Clear and compress: computing persistent homology in chunks
- Persistent intersection homology for the analysis of discrete data
- Combinatorial presentation of multidimensional persistent homology
- Computing multiparameter persistent homology through a discrete Morse-based approach
Cites work
- A Mayer-Vietoris formula for persistent homology with an application to shape recognition in the presence of occlusions
- Clear and compress: computing persistent homology in chunks
- Distributed computation of persistent homology
- Finding the homology of submanifolds with high confidence from random samples
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- On the computational complexity of Betti numbers: reductions from matrix rank
- Persistence stability for geometric complexes
- Persistent homology -- a survey
- PHAT -- persistent homology algorithms toolbox
- Simplicial homotopy theory
- Singular homology theory
- The integral K-theoretic Novikov conjecture for groups with finite asymptotic dimension
- The tidy set, a minimal simplicial set for computing homology of clique complexes
- The Vietoris-Rips complexes of a circle
- Topological pattern recognition for point cloud data
Cited in
(10)- Simplification of complexes for persistent homology computations
- Efficient Computation of Persistent Homology for Cubical Data
- A persistent homological analysis of network data flow malfunctions
- Persistent intersection homology for the analysis of discrete data
- Distributed computation of persistent homology
- Distributing persistent homology via spectral sequences
- GPU computation of the Euler characteristic curve for imaging data
- Accelerating Iterated Persistent Homology Computations with Warm Starts
- GPU computation of the Euler characteristic curve for imaging data
- Homology sequences and theorems in persistence setup -- a survey
This page was built for publication: Singular persistent homology with geometrically parallelizable computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109959)
