Computing persistent homology
Authors:
Open Access
- 8 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 33 (2) , 347-356
Abstract
We study the homology of a filtered d-dimensional simplicial complex K as a single algebraic entity and establish a correspondence that provides a simple description over fields. Our analysis enables us to derive a natural algorithm for computing persistent homology over an arbitrary field in any dimension. Our study also implies the lack of a simple classification over non-fields. Instead, we give an algorithm for computing individual persistent homology groups over an arbitrary PIDs in any dimension.Keywords
This publication has 5 references indexed in Scilit:
- On the complexity of computing the homology type of a triangulation2002
- Topological Persistence and SimplificationDiscrete & Computational Geometry, 2002
- On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic SetsDiscrete & Computational Geometry, 1999
- Computing Betti numbers via combinatorial Laplacians1996
- Hyperbolic Groups1987