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
- \textsc{Phat} -- persistent homology algorithms toolbox
- 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.
- 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?)
- Javaplex: a research software package for persistent (co)homology
- jHoles: a tool for understanding biological complex networks via clique weight rank persistent 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
Cited in
(89)- ripserr
- An entropy-based persistence barcode
- Persistent homology in \(\ell_\infty\) metric
- Generalized penalty for circular coordinate representation
- Decorated merge trees for persistent topology
- New formulas for cup-\(i\) products and fast computation of Steenrod squares
- Decomposing filtered chain complexes: geometry behind barcoding algorithms
- Persistence Steenrod modules
- Betti curves of rank one symmetric matrices
- Topological data analysis for the energy and stability of endohedral metallofullerenes
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
- Persistence landscapes of affine fractals
- Aspects of topological approaches for data science
- On Vietoris-Rips complexes of hypercube graphs
- Persistent homology and the shape of evolutionary games
- Barcodes of towers and a streaming algorithm for persistent homology
- Barcodes of towers and a streaming algorithm for persistent homology
- Elder-rule-staircodes for augmented metric spaces
- Random points on an algebraic manifold
- Persistent Homology: A Topological Tool for Higher-Interaction Systems
- The Persistent Homology of Cyclic Graphs
- Computational Science – ICCS 2005
- Computing minimal presentations and bigraded Betti numbers of 2-parameter persistent homology
- Geometric Approaches to Persistent Homology
- Approximate and discrete Euclidean vector bundles
- GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes.
- Harmonic representatives in homology over arbitrary fields
- Quantifying Different Modeling Frameworks Using Topological Data Analysis: A Case Study with Zebrafish Patterns
- Configuration spaces of disks in a strip, twisted algebras, persistence, and other stories
- The persistent topology of optimal transport based metric thickenings
- Critical edges in Rips complexes and persistence
- Discrete Morse theory for computing zigzag persistence
- Multiple hypothesis testing with persistent homology
- On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs
- Minimal graphs for contractible and dismantlable properties
- Fast computation of persistent homology representatives with involuted persistent homology
- Lower bounds on the homology of Vietoris-Rips complexes of hypercube graphs
- On the Stability of Multigraded Betti Numbers and Hilbert Functions
- Quantifying collective motion patterns in mesenchymal cell populations using topological data analysis and agent-based modeling
- Curvature sets over persistence diagrams
- Selecting embedding delays: an overview of embedding techniques and a new method using persistent homology
- Keeping it sparse: computing persistent homology revisited
- A topological data analysis based classifier
- Efficient computation of image persistence
- 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
- Maximal persistence in random clique complexes
- On the consistency and asymptotic normality of multiparameter persistent Betti numbers
- 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\)
- Adaptive approximation of persistent homology
- The discrete flow category: structure and computation
- Bipath persistence
- Short-horizon volatility spike forecasting via integrated functional and topological representations.
- HADES: fast singularity detection with local measure comparison
- Efficient computation of image persistence
- Topological data analysis and its application in financial markets
- The asymptotics of the expected Betti numbers of preferential attachment clique complexes
- Expected complexity of barcode reduction
- Cycling signatures: identifying cycling motions in time series using algebraic topology
- Cup product persistence and its efficient computation
- Wrapping cycles in Delaunay complexes: bridging persistent homology and discrete Morse theory
- Geometric bounds for persistence
- Vietoris-Rips complexes of torus grids
- Topological classification of tumour-immune interactions and dynamics
- The connectivity of Vietoris-Rips complexes of spheres
- An algorithmic discrete gradient field for non-colliding cell-like objects and the topology of pairs of points on skeleta of simplexes
- Fast computation of zigzag persistence
- State Dependent Delay Maps: Numerical Algorithms and Dynamics of Projections
- Automatic classification of magnetic field line topology by persistent homology
- A statistical framework for analyzing shape in a time series of random geometric objects
- Topological data analysis for roughness surfaces of bonding assembly
- Effective data reduction algorithm for topological data analysis
- Contractibility of the Rips complexes of integer lattices via local domination
- Parameterized inapproximability of Morse matching
- Goodness-of-fit via count statistics in dense random simplicial complexes
- Circular coordinates for density-robust analysis
- Stabilizing decomposition of multiparameter persistence modules
- Finite reconstruction with selective Rips complexes
- Facets in the Vietoris–Rips Complexes of Hypercubes
- Discrete Morse theory for open complexes
- Estimation of persistence diagrams via the three-gap theorem
- Topological signatures of quantum criticality from fidelity-based persistence
- Pruning vineyards: updating barcodes and representative cycles by removing simplices
- Extremal Betti numbers and persistence in flag complexes
- Persistent (co)homology in matrix multiplication time
- Banana trees for the persistence in time series experimentally
- A McCord-type theorem for pseudotopological spaces and directed graphs
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)
