Applications of Zigzag Persistence to Topological Data Analysis

Andrew Tausz; Gunnar Carlsson

Applications of Zigzag Persistence to Topological Data Analysis

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1108.3545 v1 pith:2CPCYHG2 submitted 2011-08-17 cs.CG

Andrew Tausz , Gunnar Carlsson This is my paper · ORCID

classification cs.CG

keywords persistencetopologicalzigzaganalysisapplicationsdataareaavenues

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

The theory of zigzag persistence is a substantial extension of persistent homology, and its development has enabled the investigation of several unexplored avenues in the area of topological data analysis. In this paper, we discuss three applications of zigzag persistence: topological bootstrapping, parameter thresholding, and the comparison of witness complexes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

TMetaNet: Topological Meta-Learning Framework for Dynamic Link Prediction
cs.LG 2025-05 conditional novelty 6.0 of 10

TMetaNet uses Dowker Zigzag Persistence features to adapt the learning rate of dynamic GNNs per snapshot, improving dynamic link prediction and noise robustness on six benchmarks.

Pith tools