Ripser: efficient computation of Vietoris-Rips persistence barcodes
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5506200 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1344784 (Why is no real title available?)
- scientific article; zbMATH DE number 732198 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- A class of algorithms which require nonlinear time to maintain disjoint sets
- An output-sensitive algorithm for persistent homology
- Computational topology. An introduction
- Computing persistent homology
- Decomposition of pointwise finite-dimensional persistence modules.
- Discrete Morse theory for free chain complexes
- Distributed computation of persistent homology
- Dualities in persistent (co)homology
- GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes.
- Javaplex: a research software package for persistent (co)homology
- Minimal resolutions via algebraic discrete Morse theory
- Morse theory for cell complexes
- Morse theory from an algebraic viewpoint
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Persistent cohomology and circular coordinates
- Random geometric complexes
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- The structure and stability of persistence modules
- Topological persistence and simplification
- Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold
- Zigzag persistent homology in matrix multiplication time
- \textsc{Phat} -- persistent homology algorithms toolbox
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent homology
Cited in
(54)- GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes.
- The persistent topology of optimal transport based metric thickenings
- Persistence Steenrod modules
- Curvature sets over persistence diagrams
- Barcodes of towers and a streaming algorithm for persistent homology
- Critical edges in Rips complexes and persistence
- Persistent Homology: A Topological Tool for Higher-Interaction Systems
- Betti curves of rank one symmetric matrices
- Selecting embedding delays: an overview of embedding techniques and a new method using persistent homology
- Persistent homology and the shape of evolutionary games
- Multiple hypothesis testing with persistent homology
- Random points on an algebraic manifold
- The Persistent Homology of Cyclic Graphs
- Barcodes of towers and a streaming algorithm for persistent homology
- Keeping it sparse: computing persistent homology revisited
- Efficient computation of image persistence
- Approximate and discrete Euclidean vector bundles
- Persistence landscapes of affine fractals
- Aspects of topological approaches for data science
- Discrete Morse theory for computing zigzag persistence
- A topological data analysis based classifier
- On Vietoris-Rips complexes of hypercube graphs
- ripserr
- Quantifying Different Modeling Frameworks Using Topological Data Analysis: A Case Study with Zebrafish Patterns
- Fast computation of persistent homology representatives with involuted persistent homology
- Lower bounds on the homology of Vietoris-Rips complexes of hypercube graphs
- An entropy-based persistence barcode
- Geometric Approaches to Persistent Homology
- Topological data analysis for the energy and stability of endohedral metallofullerenes
- On the Stability of Multigraded Betti Numbers and Hilbert Functions
- On the consistency and asymptotic normality of multiparameter persistent Betti numbers
- Maximal persistence in random clique complexes
- Minimal graphs for contractible and dismantlable properties
- Fast topological signal identification and persistent cohomological cycle matching
- Generic families of finite metric spaces with identical or trivial 1-dimensional persistence
- Topological data analysis of monopole current networks in \(U(1)\) lattice gauge theory
- Persistent homology in \(\ell_\infty\) metric
- Harmonic representatives in homology over arbitrary fields
- Generalized penalty for circular coordinate representation
- The discrete flow category: structure and computation
- Bifurcation and chaos analysis of a fractional-order delay financial risk system using dynamic system approach and persistent homology
- Computable bounds for the reach and \(r\)-convexity of subsets of \({{\mathbb{R}}}^d\)
- Elder-rule-staircodes for augmented metric spaces
- Computing minimal presentations and bigraded Betti numbers of 2-parameter persistent homology
- Decorated merge trees for persistent topology
- Adaptive approximation of persistent homology
- Bipath persistence
- Computational Science – ICCS 2005
- Configuration spaces of disks in a strip, twisted algebras, persistence, and other stories
- Decomposing filtered chain complexes: geometry behind barcoding algorithms
- New formulas for cup-\(i\) products and fast computation of Steenrod squares
- Quantifying collective motion patterns in mesenchymal cell populations using topological data analysis and agent-based modeling
- On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
This page was built for publication: Ripser: efficient computation of Vietoris-Rips persistence barcodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q133720)
