Papers › A highly specific test for periodicity
A highly specific test for periodicity
Gerrit Ansmann
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a method that allows to distinguish between nearly periodic and strictly periodic time series. To this purpose, we employ a conservative criterion for periodicity, namely that the time series can be interpolated by a periodic function whose local extrema are also present in the time series. Our method is intended for the analysis of time series generated by deterministic time-continuous dynamical systems, where it can help telling periodic dynamics from chaotic or transient ones. We empirically investigate our method's performance and compare it to an approach based on marker events (or Poincar\'e sections). We demonstrate that our method is capable of detecting small deviations from periodicity and outperforms the marker-event-based approach in typical situations. Our method requires no adjustment of parameters to the individual time series, yields the period length with a precision that exceeds the sampling rate, and its runtime grows asymptotically linear with the length of the time series.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections