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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of applied and computational topology Ročník 5; číslo 3; s. 391 - 423
Hlavní autor:	Bauer, Ulrich
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.09.2021
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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