Simplification of complexes for persistent homology computations
From MaRDI portal
Combinatorics in computer science (68R05) Software, source code, etc. for problems pertaining to algebraic topology (55-04) Abstract critical point theory (Morse theory, Lyusternik-Shnirel'man theory, etc.) in infinite-dimensional spaces (58E05) Abstract complexes in algebraic topology (55U05) Relations of low-dimensional topology with graph theory (57M15)
Abstract: In this paper we focus on preprocessing for persistent homology computations. We adapt some techniques which were successfully used for standard homology computations. The main idea is to reduce the complex prior to generating its boundary matrix, which is costly to store and process. We discuss the following reduction methods: elementary collapses, coreductions (as defined by Mrozek and Batko) and acyclic subspace method (introduced by Mrozek, Pilarczyk and .Zelazna).
Recommendations
- Dualities in persistent (co)homology
- Coreduction homology algorithm for inclusions and persistent homology
- Persistent homology: theory and practice
- Morse theory for filtrations and efficient computation of persistent homology
- Divisive cover
- Singular persistent homology with geometrically parallelizable computation
- Sketches of a platypus: a survey of persistent homology and its algebraic foundations
- Optimal reconstruction might be hard
- Persistent homology -- a survey
Cited in
(24)- Essential Simplices in Persistent Homology and Subtle Admixture Detection
- Quantitative simplification of filtered simplicial complexes
- Homology computations via acyclic subspace
- Homological shape analysis through discrete Morse theory
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Cores of simplicial complexes
- Strong Collapse for Persistence
- Computing homotopic line simplification
- Computing persistent homology of flag complexes via strong collapses
- Slice, simplify and stitch: topology-preserving simplification scheme for massive voxel data
- Morse theory for filtrations and efficient computation of persistent homology
- Computational tools in weighted persistent homology
- Computing hypergraph homology
- Multivariate topology simplification
- Discrete Stratified Morse Theory: Algorithms and A User's Guide
- scientific article; zbMATH DE number 7306880 (Why is no real title available?)
- Strong collapse and persistent homology
- Approximating persistent homology in Euclidean space through collapses
- Reducing complexes in multidimensional persistent homology theory
- Adaptive approximation of persistent homology
- Coreduction homology algorithm for inclusions and persistent homology
- Path homology theory of edge-colored graphs
- Compression for \(2\)-parameter persistent homology
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
This page was built for publication: Simplification of complexes for persistent homology computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444577)
