Papers › How to test for partially predictable chaos
How to test for partially predictable chaos
Hendrik Wernecke, Bulcsú Sándor, Claudius Gros
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.
For a chaotic system pairs of initially close-by trajectories become eventually fully uncorrelated on the attracting set. This process of decorrelation may split into an initial exponential decrease, characterized by the maximal Lyapunov exponent, and a subsequent diffusive process on the chaotic attractor causing the final loss of predictability. The time scales of both processes can be either of the same or of very different orders of magnitude. In the latter case the two trajectories linger within a finite but small distance (with respect to the overall extent of the attractor) for exceedingly long times and therefore remain partially predictable. Tests for distinguishing chaos from laminar flow widely use the time evolution of inter-orbital correlations as an indicator. Standard tests however yield mostly ambiguous results when it comes to distinguish partially predictable chaos and laminar flow, which are characterized respectively by attractors of fractally broadened braids and limit cycles. For a resolution we introduce a novel 0-1 indicator for chaos based on the cross-distance scaling of pairs of initially close trajectories, showing that this test robustly discriminates chaos, including partially predictable chaos, from laminar flow. One can use furthermore the finite time cross-correlation of pairs of initially close trajectories to distinguish, for a complete classification, also between strong and partially predictable chaos. We are thus able to identify laminar flow as well as strong and partially predictable chaos in a 0-1 manner solely from the properties of pairs of trajectories.
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