2013
DOI: 10.1103/physrevlett.110.154101
|View full text |Cite
|
Sign up to set email alerts
|

Detecting Recurrence Domains of Dynamical Systems by Symbolic Dynamics

Abstract: We propose an algorithm for the detection of recurrence domains of complex dynamical systems from time series. Our approach exploits the characteristic checkerboard texture of recurrence domains exhibited in recurrence plots. In phase space, recurrence plots yield intersecting balls around sampling points that could be merged into cells of a phase space partition. We construct this partition by a rewriting grammar applied to the symbolic dynamics of time indices. A maximum entropy principle defines the optimal… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
57
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 38 publications
(58 citation statements)
references
References 17 publications
(53 reference statements)
0
57
0
1
Order By: Relevance
“…For finding an optimal partition and hence an optimal value for ε, beim Graben and Hutt [12,26] and beim Graben et al [27] have suggested several entropybased criteria. To gain an optimal segmentation, the idea is to assume an underlying stochastic model for the symbolic sequences.…”
Section: Identification Of Ho: the Recurrence Structure Analysismentioning
confidence: 99%
See 3 more Smart Citations
“…For finding an optimal partition and hence an optimal value for ε, beim Graben and Hutt [12,26] and beim Graben et al [27] have suggested several entropybased criteria. To gain an optimal segmentation, the idea is to assume an underlying stochastic model for the symbolic sequences.…”
Section: Identification Of Ho: the Recurrence Structure Analysismentioning
confidence: 99%
“…Recurrent events (R ij = 1) of the dynamics lead to intersecting ε-balls B ε (x i ) ∩ B ε (x j ) = ∅ which can be merged together into equivalence classes of phase space X. By merging balls together into a set A j = B ε (x i ) ∪ B ε (x j ) when states x i and x j are recurrent and when i > j, we simply replace the larger time index i in the recurrence plot R by the smaller one j, symbolized as a rewriting rule i → j of a recurrence grammar [12,26,27].…”
Section: Identification Of Ho: the Recurrence Structure Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…In the field of neuroscience, symbolic dynamics was applied, e.g. to characterized brain microstates [7], to study the recurrence of microstates during stimulus [8], to detect determinism in periictal intracranial electroencephalographic signals [9], to predict epileptic seizures [10], to assess causal relations between brain signals under different levels of consciousness [11], to detect the development of epileptic seizure [12,13], and to investigate the central-autonomic coupling in mental disorder [14,15].…”
Section: Introductionmentioning
confidence: 99%