Computing persistent homology with various coefficient fields in a single pass
DOI10.1007/s41468-019-00025-yzbMath1476.55013arXiv2001.02960OpenAlexW3010869111WikidataQ127954435 ScholiaQ127954435MaRDI QIDQ2324603
Jean-Daniel Boissonnat, Clément Maria
Publication date: 11 September 2019
Published in: Journal of Applied and Computational Topology, Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02960
Symbolic computation and algebraic computation (68W30) Persistent homology and applications, topological data analysis (55N31) Computational aspects of data analysis and big data (68T09) Topological data analysis (62R40)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the phase transition in random simplicial complexes
- Persistent cohomology and circular coordinates
- Homological connectivity of random 2-complexes
- Stability of persistence diagrams
- The compressed annotation matrix: an efficient data structure for computing persistent cohomology
- On the local behavior of spaces of natural images
- Topology of random geometric complexes: a survey
- Integral homology of random simplicial complexes
- Computing persistent homology
- Topological persistence and simplification
- Computing persistent homology with various coefficient fields in a single pass
- Approximate formulas for some functions of prime numbers
- Clear and Compress: Computing Persistent Homology in Chunks
- Faster Integer Multiplication
- Computing Topological Persistence for Simplicial Maps
- Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes
This page was built for publication: Computing persistent homology with various coefficient fields in a single pass
