Zigzag persistent homology and real-valued functions
Authors:
Open Access
- 8 June 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 247-256
Abstract
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a topological space. The result is a local, symmetric interval descriptor of the function. Our structural results establish a connection between the zigzag pairs in this sequence and extended persistence, and in the process resolve an open question associated with the latter. Our algorithmic results not only provide a way to compute zigzag persistence for any sequence of homology groups, but combined with our structural results give a novel algorithm for computing extended persistence. This algorithm is easily parallelizable and uses (asymptotically) less memory.Keywords
This publication has 8 references indexed in Scilit:
- Proximity of persistence modules and their diagrams2009
- Extending Persistence Using Poincaré and Lefschetz DualityFoundations of Computational Mathematics, 2008
- Stability of Critical Points with Interval PersistenceDiscrete & Computational Geometry, 2007
- Stability of Persistence DiagramsDiscrete & Computational Geometry, 2006
- Vines and vineyards by updating persistence in linear time2006
- Computing Persistent HomologyDiscrete & Computational Geometry, 2004
- Topological Persistence and SimplificationDiscrete & Computational Geometry, 2002
- Unzerlegbare Darstellungen Imanuscripta mathematica, 1972