Computing Persistent Homology

@article{Zomorodian2004ComputingPH,
  title={Computing Persistent Homology},
  author={Afra Zomorodian and Gunnar E. Carlsson},
  journal={Discrete \& Computational Geometry},
  year={2004},
  volume={33},
  pages={249-274}
}
Abstract We show that the persistent homology of a filtered d-dimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields. It also enables us to derive a natural algorithm for computing persistent homology of spaces in arbitrary dimension over any field. This result generalizes and extends the previously known algorithm… 
View on ACM
link.springer.com
993 Citations
Highly Influential Citations
67
Background Citations
516
Methods Citations
259
Results Citations
5

993 Citations

Citation Type

Citation Type

Defining and computing persistent Z-homology in the general case
TLDR
One of the main contributions of this paper is the observation that a slight modification of previous programs computing spectral sequences is enough to compute also persistent homology.
Computing persistent homology with various coefficient fields in a single pass
TLDR
An algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction allows us to infer the prime divisors of the torsion coefficients of the integral homology groups of the topological space at any scale, hence furnishing a more informative description of topology than persistence in asingle coefficient field.
Persistence modules: Algebra and algorithms
TLDR
A number of facts about persistence modules are presented; ranging from the well-known but under-utilized to the reconstruction of techniques to work in a purely algebraic approach to persistent homology.
Parallel Computation of Persistent Homology using the Blowup Complex
TLDR
A parallel algorithm that computes persistent homology, an algebraic descriptor of a filtered topological space, by operating on a spatial decomposition of the domain, as opposed to a decomposition with respect to the filtration.
Harmonic Persistent Homology
We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the…
Persistent Intersection Homology
TLDR
This paper gives an algorithm for the computation of the persistent intersection homology groups of a filtered simplicial complex equipped with a stratification by subcomplexes, and it is proved its correctness.
Persistent Homology of Filtered Covers
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now…
Efficient Computation of Simplicial Homology through Acyclic Matching
TLDR
This work analyzes, compares and discusses the equivalence of different methods based on combining reductions, co reductions and discrete Morse theory, and shows that the combination of these methods produces theoretically sound approaches which are mutually equivalent.
A computational framework for weighted simplicial homology
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring R = F[[π]]. This is achieved by starting from a basis for…
A directed persistent homology theory for dissimilarity functions
We develop a theory of persistent homology for directed simplicial complexes which detects persistent directed cycles in odd dimensions. In order to do so, we introduce a homology theory with…
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
TLDR
Alternative approaches to the calculation of simplicial homology are described and motivating examples and actual experiments with the GAP package that was implemented by the authors are described.
On the complexity of computing the homology type of a triangulation
  • B. Donald, D. R. Chang
  • Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
TLDR
The algorithm could be used in computer-aided design to tell whether two finite-element meshes or Bezier-spline surfaces are of the same topological type, and whether they can be embedded in R/sup 3/.
Persistence barcodes for shapes
TLDR
This paper initiates a study of shape description and classification via the application of persistent homology to two tangential constructions on geometric objects, obtaining a shape descriptor, called a barcode, that is a finite union of intervals.
Computing and comprehending topology: persistence and hierarchical morse complexes
TLDR
The authors begin by extending the concept of addition to binary operations, which is based on abstracting from algebra its core properties, and studying algebra in terms of those properties.
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets
  • S. Basu
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1999
TLDR
It is proven that the sum of the Betti numbers of S is bounded by sk' 2O(k2 m4) in case the total number of monomials occurring in the polynomials in $ {\cal P} \cup \{Q\}$ is m.
Elements of algebraic topology
Elements of Algebraic Topology provides the most concrete approach to the subject. With coverage of homology and cohomology theory, universal coefficient theorems, Kunneth theorem, duality in…
Topological estimation using witness complexes
TLDR
This paper tackles the problem of computing topological invariants of geometric objects in a robust manner, using only point cloud data sampled from the object, and produces a nested family of simplicial complexes, which represent the data at different feature scales, suitable for calculating persistent homology.
Computing Betti Numbers via Combinatorial Laplacians
  • J. Friedman
  • Computer Science, Mathematics
    Algorithmica
  • 1998
TLDR
The Laplacian and power method is used to compute Betti numbers of simplicial complexes, which has a number of advantages over other methods, both in theory and in practice, but its running time depends on a ratio, ν, of eigenvalues which the authors have yet to understand fully.
Topological Persistence and Simplification
TLDR
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
An Algebraic Topological Method for Feature Identification
TLDR
A mathematical framework for describing local features of a geometric object—such as the edges of a square or the apex of a cone—in terms of algebraic topological invariants can be used to develop algorithms for automatic feature location.
...
...