On Association between Absolute and Relative Zigzag Persistence
Tamal K. Dey, Tao Hou

TL;DR
This paper establishes a weak duality for non-repetitive zigzag filtrations, enabling near-linear algorithms for computing certain persistence modules and improving computational efficiency in zigzag persistence analysis.
Contribution
It introduces a weak duality for non-repetitive zigzag filtrations and develops an efficient algorithm for computing persistence modules, reducing zigzag persistence to standard persistence computations.
Findings
Weak duality for non-repetitive zigzag filtrations.
Near-linear algorithm for computing persistence modules.
Performance gains in zigzag persistence computation.
Abstract
Duality results connecting persistence modules for absolute and relative homology provides a fundamental understanding into persistence theory. In this paper, we study similar associations in the context of zigzag persistence. Our main finding is a weak duality for the so-called non-repetitive zigzag filtrations in which a simplex is never added again after being deleted. The technique used to prove the duality for non-zigzag persistence does not extend straightforwardly to our case. Accordingly, taking a different route, we prove the weak duality by converting a non-repetitive filtration to an up-down filtration by a sequence of diamond switches. We then show an application of the weak duality result which gives a near-linear algorithm for computing the -th and a subset of the -th persistence for a non-repetitive zigzag filtration of a simplicial -manifold. Utilizing the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Advanced Neuroimaging Techniques and Applications
