Corpus ID: 119123948

Parallel multi-scale reduction of persistent homology filtrations

  title={Parallel multi-scale reduction of persistent homology filtrations},
  author={Rodrigo Mendoza-Smith and Jared Tanner},
  journal={arXiv: Algebraic Topology},
The persistent homology pipeline includes the reduction of a, so-called, boundary matrix. We extend the work of Bauer et al. (2014) and Chen et al. (2011) where they show how to use dependencies in the boundary matrix to adapt the reduction algorithm presented in Edelsbrunner et al. (2002) in such a way as to reduce its computational cost. Herein we present a number of additional dependencies in the boundary matrices and propose a novel parallel algorithms for the reduction of boundary matrices… Expand

Figures and Tables from this paper

HYPHA: a framework based on separation of parallelisms to accelerate persistent homology matrix reduction
This paper introduces HYPHA, a HYbrid Persistent Homology matrix reduction Accelerator, to make parallel processing highly efficient on both GPU and multicore, and achieves the highest performance in PH matrix reduction execution. Expand
Computing persistent homology in parallel with a functional language
Persistent homology, first developed at the beginning of the millennium, is a tool within the field of topological data analysis. It is an extension of simplicial homology to filtrations ofExpand
Persistent homology for low-complexity models
  • Martin Lotz
  • Mathematics, Computer Science
  • Proceedings of the Royal Society A
  • 2019
The Gaussian width is connected to the doubling dimension of a finite metric space, which appears in the study of the complexity of other methods for approximating persistent homology, and can literally replace the ambient dimension by an intrinsic notion of dimension related to the structure of the data. Expand
Ripser: efficient computation of Vietoris-Rips persistence barcodes
  • U. Bauer
  • Computer Science, Mathematics
  • J. Appl. Comput. Topol.
  • 2021
An algorithm for the computation of Vietoris–Rips persistence barcodes that 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 of independent interest. Expand
Sampling Real Algebraic Varieties for Topological Data Analysis
This work presents an adaptive algorithm for finding provably dense samples of points on real algebraic varieties given a set of defining polynomials for use as input to TDA. Expand
Computing persistent homology in Futhark
  • Erik von Brömssen
  • Proceedings of the 9th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing
  • 2021
We present a massively parallel algorithm for computing persistent homology, a concept within the field of topological data analysis, and we implement it in the purely functional array-based languageExpand
GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes
This paper develops a GPU-accelerated software for computing Vietoris-Rips persistence barcodes, called Ripser++, and identifies several unique mathematical properties and algorithmic opportunities with connections to the GPU that open a new chapter for the advancement of topological data analysis in the post-Moore's Law era. Expand


Clear and Compress: Computing Persistent Homology in Chunks
This work presents a parallel algorithm for computing the persistent homology of a filtered chain complex by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix. Expand
Distributed Computation of Persistent Homology
It is demonstrated that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems that 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. Expand
A roadmap for the computation of persistent homology
A friendly introduction to PH is given, the pipeline for the computation of PH is navigated with an eye towards applications, and a range of synthetic and real-world data sets are used to evaluate currently available open-source implementations for the computations of PH. Expand
Persistent Homology Computation with a Twist
The persistence diagram of a filtered simplicial complex is usually computed by reducing the boundary matrix of the complex. We introduce a simple optimization technique: by processing the simplicesExpand
Zigzag persistent homology in matrix multiplication time
A new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of simplex additions and deletions, which takes O(n3) time in the worst case. Expand
Persistent cohomology and circular coordinates
This work develops a machinery of persistent cohomology to identify candidates for significant circle-structures in the data and uses harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves, and suggests that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets. Expand
Dualities in persistent (co)homology
This work explains how one can use the existing algorithm for persistent homology to process any of the four modules, and relates it to a recently introduced persistent cohomology algorithm, and presents experimental evidence for the practical efficiency of the latter algorithm. Expand
javaPlex: A Research Software Package for Persistent (Co)Homology
A new software package for topological computation, replacing previous jPlex and Plex, enables researchers to access state of the art algorithms for persistent homology, cohomology, hom complexes, filtered simplicial complex, filtered cell complexes, witness complex constructions, and many more essential components of computational topology. Expand
Topology and data
This paper will discuss how geometry and topology can be applied to make useful contributions to the analysis of various kinds of data, particularly high throughput data from microarray or other sources. Expand
The Persistent Homology of Distance Functions under Random Projection
This paper shows that the persistent homology of the distance function to P is also preserved up to a comparable constant factor, and proves these results in the more general setting of weighted kth nearest neighbor distances. Expand