Distributed computation of persistent homology
From MaRDI portal
Abstract: Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not exhaust the available memory. Following up on a recently presented parallel method for persistence computation on shared memory systems, we demonstrate that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems. Our algorithmic design ensures that the data is distributed over the nodes without redundancy; this permits the computation of much larger instances than on a single machine. Moreover, we observe that the parallelism at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms. In our experiments, we were able to compute the persistent homology of filtrations with more than a billion (10^9) elements within seconds on a cluster with 32 nodes using less than 10GB of memory per node.
Recommendations
Cited in
(32)- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Computational tools in weighted persistent homology
- Persistent homology in \(\ell_\infty\) metric
- HERMES: persistent spectral graph software
- Generalized persistence algorithm for decomposing multiparameter persistence modules
- A simplified algorithm for identifying abnormal changes in dynamic networks
- Biomolecular topology: modelling and analysis
- Aspects of topological approaches for data science
- Local computation of homology variations over a construction process
- Computing multiparameter persistent homology through a discrete Morse-based approach
- Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
- Divisive cover
- Geometric metrics for topological representations
- Clear and compress: computing persistent homology in chunks
- Metric spaces with expensive distances
- Persistent Homology: A Topological Tool for Higher-Interaction Systems
- Singular persistent homology with geometrically parallelizable computation
- Learning representations of persistence barcodes
- Efficient, Decentralized Computation of the Topology of Spatial Regions
- Distributed Point Functions and Their Applications
- Computing minimal presentations and bigraded Betti numbers of 2-parameter persistent homology
- Distributing persistent homology via spectral sequences
- GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes.
- Homology of configuration spaces of hard squares in a rectangle
- Discrete Morse theory for computing zigzag persistence
- Fast computation of persistent homology representatives with involuted persistent homology
- Accelerating Iterated Persistent Homology Computations with Warm Starts
- Keeping it sparse: computing persistent homology revisited
- Computing hypergraph homology
- Bipath persistence
- VHS: a package for homological simplification of voxelized plant root data for skeletonization
- \textsc{Phat} -- persistent homology algorithms toolbox
This page was built for publication: Distributed computation of persistent homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232488)
