Ripser: efficient computation of Vietoris–Rips persistence barcodes
Journal of Applied and Computational Topology · 2021-09 · 5 (3) · 391-423
DOI: 10.1007/s41468-021-00071-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied and Computational Topology, online erschienen am 17.06.2021. Verfasst von Ulrich Bauer. Die Arbeit wurde bisher 316-mal zitiert (Crossref) und nennt 54 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft.
Abstract (Originalsprache)
We 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.
Förderung
- Deutsche Forschungsgemeinschaft
Zitieren
APA
Bauer, U. (2021). Ripser: efficient computation of Vietoris–Rips persistence barcodes. Journal of Applied and Computational Topology, 5(3), 391-423. https://doi.org/10.1007/s41468-021-00071-5
Vancouver
Bauer U. Ripser: efficient computation of Vietoris–Rips persistence barcodes. Journal of Applied and Computational Topology. 2021;5(3):391-423. doi:10.1007/s41468-021-00071-5
BibTeX
@article{Bauer2021,
author = {Bauer, Ulrich},
title = {Ripser: efficient computation of Vietoris–Rips persistence barcodes},
journal = {Journal of Applied and Computational Topology},
year = {2021},
volume = {5},
number = {3},
pages = {391--423},
doi = {10.1007/s41468-021-00071-5}
}
EUVIMED