The work introduces subsampling confidence bounds for persistence diagrams of time-delay embeddings and an asymptotically valid test for periodicity that performs comparably to Lomb-Scargle on periodic data and better on chirps.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subsampling Confidence Bound for Persistent Diagram via Time-delay Embedding
The work introduces subsampling confidence bounds for persistence diagrams of time-delay embeddings and an asymptotically valid test for periodicity that performs comparably to Lomb-Scargle on periodic data and better on chirps.