Papers › On the Implementation of the 0-1 Test for Chaos
On the Implementation of the 0-1 Test for Chaos
Georg A. Gottwald, Ian Melbourne
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.
In this paper we address practical aspects of the implementation of the 0-1 test for chaos in deterministic systems. In addition, we present a new formulation of the test which significantly increases its sensitivity. The test can be viewed as a method to distill a binary quantity from the power spectrum. The implementation is guided by recent results from the theoretical justification of the test as well as by exploring better statistical methods to determine the binary quantities. We give several examples to illustrate the improvement.
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