1983
DOI: 10.1016/0167-2789(83)90127-6
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic dynamics of noisy chaos

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
131
0
3

Year Published

1986
1986
2013
2013

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 174 publications
(135 citation statements)
references
References 34 publications
1
131
0
3
Order By: Relevance
“…Among them, the time delay embedded reconstruction [1] provides a general framework for the estimation of invariant quantities (in terms of smooth transformations of the state space of the attractor) of the original system, such as attractor dimensions, Lyapunov exponents and entropies [2][3] [4]. Information theoretic measures of structural complexity include effective measure complexity (EMC) [5], excess entropy [6], and predictive information [7] [8].…”
Section: Introductionmentioning
confidence: 99%
“…Among them, the time delay embedded reconstruction [1] provides a general framework for the estimation of invariant quantities (in terms of smooth transformations of the state space of the attractor) of the original system, such as attractor dimensions, Lyapunov exponents and entropies [2][3] [4]. Information theoretic measures of structural complexity include effective measure complexity (EMC) [5], excess entropy [6], and predictive information [7] [8].…”
Section: Introductionmentioning
confidence: 99%
“…They are actually known for only a few synthetic examples such as the torus map, the standard map or the Henon map [36][37][38]. Therefore, algorithms have been suggested to estimate them from experimental time series [39][40][41][42].…”
Section: Empirical Constructionmentioning
confidence: 99%
“…If E is a generating partition, then all refinements of E are also generating partitions. Furthermore, if E is generating, then the sigma algebra generated by all refinements of E coincides with the sigma algebra of all measurable subsets of M [28][29][30].…”
Section: Symbolic Dynamicsmentioning
confidence: 99%
“…where the supremum is taken over all measurable partitions E and where [28][29][30]. Systems with a positive KS entropy are called K systems.…”
Section: Symbolic Dynamicsmentioning
confidence: 99%