Corpus ID: 199472975

Ripser: efficient computation of Vietoris-Rips persistence barcodes

@article{Bauer2019RipserEC,
  title={Ripser: efficient computation of Vietoris-Rips persistence barcodes},
  author={U. Bauer},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.02518}
}
  • U. Bauer
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
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 of the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix. Our implementation shows substantial improvements over previous software both in time and memory usage. 
68 Citations
Towards Lockfree Persistent Homology
Fast Minimal Presentations of Bi-graded Persistence Modules
The Structure of Morphisms in Persistent Homology, I. Functorial Dualities
Vietoris-Rips Homology Theory for Semi-Uniform Spaces
Brief Announcement: Towards Lockfree Persistent Homology
Ripserer.jl: flexible and efficient persistent homology computation in Julia
Move Schedules: Fast persistence computations in sparse dynamic settings
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Matroid Filtrations and Computational Persistent Homology
Persistent Homology Computation with a Twist
Zigzag persistent homology in matrix multiplication time
Vines and vineyards by updating persistence in linear time
Topological Persistence and Simplification
Dualities in persistent (co)homology
An output-sensitive algorithm for persistent homology
The Structure and Stability of Persistence Modules
Distributed Computation of Persistent Homology
...
1
2
3
4
5
...