2006
DOI: 10.1016/j.shpsb.2006.02.003
|View full text |Cite
|
Sign up to set email alerts
|

The ergodic hierarchy, randomness and Hamiltonian chaos

Abstract: Various processes are often classified as both deterministic and random or chaotic. The main difficulty in analysing the randomness of such processes is the apparent tension between the notions of randomness and determinism: what type of randomness could exist in a deterministic process? Ergodic theory seems to offer a particularly promising theoretical tool for tackling this problem by positing a hierarchy, the so-called 'ergodic hierarchy' (EH), which is commonly assumed to provide a hierarchy of increasing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
57
0
4

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 84 publications
(62 citation statements)
references
References 21 publications
1
57
0
4
Order By: Relevance
“…It is mathematically extremely hard to prove that descriptions satisfy the assumption of Theorem 1. Therefore, for many descriptions it is conjectured, but not proven, that they satisfy this assumption, e.g., for any finite number of hard balls in a box or for the Hénon description for many other parameter values (see Benedicks and Young 1993;Berkovitz et al 2006). So far we have focused on how to obtain stochastic descriptions when deterministic descriptions are given.…”
Section: The Results On Observational Equivalencementioning
confidence: 99%
“…It is mathematically extremely hard to prove that descriptions satisfy the assumption of Theorem 1. Therefore, for many descriptions it is conjectured, but not proven, that they satisfy this assumption, e.g., for any finite number of hard balls in a box or for the Hénon description for many other parameter values (see Benedicks and Young 1993;Berkovitz et al 2006). So far we have focused on how to obtain stochastic descriptions when deterministic descriptions are given.…”
Section: The Results On Observational Equivalencementioning
confidence: 99%
“…The ergodic hierarchy ranks the chaos of a dynamical system according to a type of correlation C(T t A, B) between two subsets A and B of X that are separated by a time t. This is defined as [19,20] …”
Section: The Ergodic Hierarchymentioning
confidence: 99%
“…Besides, in dynamical systems theory, the ergodic hierarchy (EH) characterizes the chaotic behavior in terms of a type of correlation between subsets of the phase space [19,20]. In the asymptotic limit of large times, the EH establishes that the dynamics is more chaotic when the correlation decays faster.…”
Section: Introductionmentioning
confidence: 99%
“…A (discrete) dynamical system can be characterised by four parameters: a set of basic states , a σ-algebra Σ on (intuitively, the possible outcomes in the system, corresponding to regions of the basic space ), some measure such that = 1, and a deterministic evolution map from onto , which captures the lawlike evolution of states over one time step (Berkovitz and Frigg, 2006). Following Werndl (2009), a dynamical system is chaotic iff it is mixing: for all , ∈ Σ (where ' ! '…”
Section: Randomness Without Chancementioning
confidence: 99%