Abstract
AbstractWe present an algorithm for the computation of Vietoris–Rips persistence barcodes and describe its implementation in the software Ripser. The method relies on implicit representations of the coboundary operator and the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix. Moreover, it makes use of apparent pairs, a simple but powerful method for constructing a discrete gradient field from a total order on the simplices of a simplicial complex, which is also of independent interest. Our implementation shows substantial improvements over previous software both in time and memory usage.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference54 articles.
1. Barannikov, S.A.: The framed Morse complex and its invariants. In: Singularities and Bifurcations, Volume 21 of Advances in Soviet Mathematics, pp. 93–115. American Mathematical Society, Providence (1994)
2. Bauer, U.: Ripser: a lean C++ code for the computation of Vietoris–Rips persistence barcodes (2016). http://ripser.org
3. Bauer, U., Schmahl, M.: Lifespan functors and natural dualities in persistent homology. Preprint (2020). arXiv: 2012.12881
4. Bauer, U., Kerber, M., Reininghaus, J.: Distributed computation of persistent homology. In: Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 31–38. SIAM (2014). Software available at https://github.com/DIPHA/dipha
5. Bauer, U., Kerber, M., Reininghaus, J., Wagner, H.: PHAT—persistent homology algorithms toolbox. J. Symb. Comput. 78, 76–90 (2016)
Cited by
122 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献