REVIEW 1 cited by
On Emergence and Complexity of Ergodic Decompositions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
A concept of emergence was recently introduced in the paper [Berger] in order to quantify the richness of possible statistical behaviors of orbits of a given dynamical system. In this paper, we develop this concept and provide several new definitions, results, and examples. We introduce the notion of topological emergence of a dynamical system, which essentially evaluates how big the set of all its ergodic probability measures is. On the other hand, the metric emergence of a particular reference measure (usually Lebesgue) quantifies how non-ergodic this measure is. We prove fundamental properties of these two emergences, relating them with classical concepts such as Kolmogorov's $\epsilon$-entropy of metric spaces and quantization of measures. We also relate the two types of emergences by means of a variational principle. Furthermore, we provide several examples of dynamics with high emergence. First, we show that the topological emergence of some standard classes of hyperbolic dynamical systems is essentially the maximal one allowed by the ambient. Secondly, we construct examples of smooth area-preserving diffeomorphisms that are extremely non-ergodic in the sense that the metric emergence of the Lebesgue measure is essentially maximal. These examples confirm that super-polynomial emergence indeed exists, as conjectured in the paper [Berger]. Finally, we prove that such examples are locally generic among smooth diffeomorphisms.
Forward citations
Cited by 1 Pith paper
-
Ulam meets Turing: constructing quadratic maps with non-computable SRB measures
There exist computable parameters a for which the logistic map fa(x)=ax(1-x) has a unique physical (SRB) measure that is not Turing computable.
Discussion (0). Continue with ORCID to comment.