Subsampling Confidence Bound for Persistent Diagram via Time-delay Embedding
Donghyun Park, Junhyun An, Taehyoung Kim, Jisu Kim

TL;DR
This paper introduces a statistically rigorous subsampling method to quantify uncertainty in persistent homology for time-delay embeddings, enabling reliable periodicity detection in time-series data.
Contribution
It develops a new subsampling-based approach with asymptotic guarantees for confidence bounds on persistence diagrams in TDA, and applies it to periodicity testing.
Findings
Method achieves detection performance comparable to Lomb-Scargle Periodogram.
It exhibits superior robustness for non-periodic signals with time-varying frequencies.
Successfully detects periodicity in real BIDMC dataset.
Abstract
Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing the phase space dynamics of time-series data. Persistent homology effectively identifies global topological features, such as loops associated with periodicity. Nevertheless, a statistically rigorous way to quantify uncertainty in the resulting topological features has remained underdeveloped -- a problem that we aim to challenge. First, we analyze the topological characterization of time-delay embeddings under both periodic and non-periodic conditions. Precisely, the embedded trajectory is homotopy equivalent to a circle () for periodic signals and is contractible for non-periodic ones. We also prove that the reach of the sliding window embedding is lower-bounded, ensuring stable persistence features. Next, we propose a subsampling-based method to construct confidence bounds for…
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.
