DeepAI AI Chat
Log In Sign Up

Fast Computation of Zigzag Persistence

by   Tamal K. Dey, et al.
Purdue University

Zigzag persistence is a powerful extension of the standard persistence which allows deletions of simplices besides insertions. However, computing zigzag persistence usually takes considerably more time than the standard persistence. We propose an algorithm called FastZigzag which narrows this efficiency gap. Our main result is that an input simplex-wise zigzag filtration can be converted to a cell-wise non-zigzag filtration of a Δ-complex with the same length, where the cells are copies of the input simplices. This conversion step in FastZigzag incurs very little cost. Furthermore, the barcode of the original filtration can be easily read from the barcode of the new cell-wise filtration because the conversion embodies a series of diamond switches known in topological data analysis. This seemingly simple observation opens up the vast possibilities for improving the computation of zigzag persistence because any efficient algorithm/software for standard persistence can now be applied to computing zigzag persistence. Our experiment shows that this indeed achieves substantial performance gain over the existing state-of-the-art softwares.


page 1

page 2

page 3

page 4


On Association between Absolute and Relative Zigzag Persistence

Duality results connecting persistence modules for absolute and relative...

Ripser: efficient computation of Vietoris-Rips persistence barcodes

We present an algorithm for the computation of Vietoris-Rips persistence...

An efficient algorithm for 1-dimensional (persistent) path homology

This paper focuses on developing an efficient algorithm for analyzing a ...

Computing Connection Matrices via Persistence-like Reductions

Connection matrices are a generalization of Morse boundary operators fro...

GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes

The computation of Vietoris-Rips persistence barcodes is both execution-...

Swap, Shift and Trim to Edge Collapse a Filtration

Boissonnat and Pritam introduced an algorithm to reduce a filtration of ...

Revisiting Graph Persistence for Updates and Efficiency

It is well known that ordinary persistence on graphs can be computed mor...

Code Repositories


Fast Computation of Zigzag Persistence

view repo