2009
DOI: 10.1137/080718851
|View full text |Cite
|
Sign up to set email alerts
|

On the Implementation of the 0–1 Test for Chaos

Abstract: 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… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

5
353
0
3

Year Published

2013
2013
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 404 publications
(361 citation statements)
references
References 23 publications
(51 reference statements)
5
353
0
3
Order By: Relevance
“…1 (in present calculations n ¼ n max ¼ 150 while N ¼ 1350) we obtain the corresponding values of K c for a chosen value of c. Note, our choice of n max and N limits (in Eqs. 4,5) is consistent with that proposed by Gottwald and Melbourne [34,35,40]. N; n max !…”
Section: The 0-1 Testsupporting
confidence: 78%
See 2 more Smart Citations
“…1 (in present calculations n ¼ n max ¼ 150 while N ¼ 1350) we obtain the corresponding values of K c for a chosen value of c. Note, our choice of n max and N limits (in Eqs. 4,5) is consistent with that proposed by Gottwald and Melbourne [34,35,40]. N; n max !…”
Section: The 0-1 Testsupporting
confidence: 78%
“…If c is badly chosen, it could resonate with the excitation frequency or its super-or sub-harmonics. In the 0-1 test, regular motion would yield an expanding behaviour in the (p, q)-plane [34] and the corresponding M c ðnÞ has an asymptotic growth rate even for a regular system. The disadvantage of the test, its strong dependence on the chosen parameter c, can be overcome by a proposed modification.…”
Section: The 0-1 Testmentioning
confidence: 99%
See 1 more Smart Citation
“…Of great importance in this direction was also the algorithm proposed by Benettin and co-workers [3,4,5] regarding the computation of the full spectrum of Lyapunov exponents (LEs) associated with the time evolution of deviation vectors from a reference orbit, which applies to dynamical systems of arbitrary dimension. More recently, other related methods have been proposed in the literature, like the "Fast Lyapunov Indicator" [6,7] and the "Mean Exponential Growth of Nearby Orbits" (MEGNO) [8,9], while there have also been approaches focusing on the time series constructed by the coordinates of each orbit, like the "Frequency Map Analysis" [10,11,12] and the "0-1" test [13,14,15]. Interesting accounts of these methods can be found in [16], as well as in a more recent review paper [5].…”
Section: Introductionmentioning
confidence: 99%
“…Between one fifth and one quarter of Compound networks actually showed stable, non-oscillating dynamic values of W. For 19 (4%) of the networks, we found evidence of aperiodicity. Four of these aperiodic networks passed the 0-1 test for chaos [41,42] with 10 replicate runs giving R values>0.99. The longest repeating period we observed was 210 iterations.…”
Section: Oscillation Periodmentioning
confidence: 99%