Strong collapse and persistent homology
From MaRDI portal
Publication:5880377
DOI10.1142/S1793525321500296MaRDI QIDQ5880377
Siddharth Pritam, Divyansh Pareek, Jean-Daniel Boissonnat
Publication date: 9 March 2023
Published in: Journal of Topology and Analysis (Search for Journal in Brave)
Software, source code, etc. for problems pertaining to algebraic topology (55-04) Persistent homology and applications, topological data analysis (55N31) Computational methods for problems pertaining to algebraic topology (55-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Morse theory for filtrations and efficient computation of persistent homology
- Foldings in graphs and relations with simplicial complexes and posets
- Strong homotopy types, nerves and collapses
- Complexity of simplicial homology and independence complexes of chordal graphs
- Polynomial-sized topological approximations using the permutahedron
- Computing persistent homology
- Zigzag persistence
- Approximating persistent homology in Euclidean space through collapses
- Linear-size approximations to the Vietoris-Rips filtration
- Building efficient and compact data structures for simplicial complexes
- Barcodes of towers and a streaming algorithm for persistent homology
- Simplification of complexes for persistent homology computations
- Approximate Čech Complex in Low and High Dimensions
- Powers of tensors and fast matrix multiplication
- Towards persistence-based reconstruction in euclidean spaces
- SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch-collapse
- An Efficient Representation for Filtrations of Simplicial Complexes
- Computing Topological Persistence for Simplicial Maps
- Strong Collapse for Persistence
- Computing Persistent Homology of Flag Complexes via Strong Collapses
- Zigzag persistent homology and real-valued functions
- Zigzag persistent homology in matrix multiplication time
- Simplicial Spaces, Nuclei and m -Groups
