Ripser: efficient computation of Vietoris–Rips persistence barcodes

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of applied and computational topology Jg. 5; H. 3; S. 391 - 423
1. Verfasser: Bauer, Ulrich
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.09.2021
Schlagworte:
Algebraic Topology
Computational Science and Engineering
Mathematical and Computational Biology
Mathematics
Mathematics and Statistics
55N31 . 55-04
Persistent homology . Vietoris-Rips complexes . Topological data analysis . Discrete Morse theory
ISSN:2367-1726, 2367-1734
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2367-1726
2367-1734
DOI:10.1007/s41468-021-00071-5