Where and when orbits of chaotic systems prefer to go

DOI10.1088/1361-6544/AB0C34MaRDI QIDQ4632035zbMATHOpenAlexWikidataFDO

Authors Mark Bolding, Leonid A. Bunimovich

Publication date 25 April 2019

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.04231

zbMATH Keywords

chaosstochastic systems

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Ergodic theorems, spectral theory, Markov operators (37A30) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Dynamical aspects of statistical mechanics (37A60) Orbit growth in dynamical systems (37C35)

Abstract: We prove that transport in the phase space of the "most strongly chaotic" dynamical systems has three different stages. Consider a finite Markov partition (coarse graining) $xi$ of the phase space of such a system. In the first short times interval there is a hierarchy with respect to the values of the first passage probabilities for the elements of $xi$ and therefore finite time predictions can be made about which element of the Markov partition trajectories will be most likely to hit first at a given moment. In the third long times interval, which goes to infinity, there is an opposite hierarchy of the first passage probabilities for the elements of $xi$ and therefore again finite time predictions can be made. In the second intermediate times interval there is no hierarchy in the set of all elements of the Markov partition. We also obtain estimates on the length of the short times interval and show that its length is growing with refinement of the Markov partition which shows that practically only this interval should be taken into account in many cases. These results demonstrate that finite time predictions for the evolution of strongly chaotic dynamical systems are possible. In particular, one can predict that an orbit is more likely to first enter one subset of phase space than another at a given moment in time. Moreover, these results suggest an algorithm which accelerates the process of escape through "holes" in the phase space of dynamical systems with strongly chaotic behavior.

Recommendations

• Where to place a hole to achieve a maximal escape rate
• Why escape is faster than expected
• Faster than expected escape for a class of fully chaotic maps
• Phase-space prediction of chaotic time series
• Which hole is leaking the most: a topological approach to study open systems

Cites work

• Autocorrelation and the Enumeration of Strings Avoiding a Fixed String
• Behaviour of the escape rate function in hyperbolic dynamical systems
• Escape rates and conditionally invariant measures
• Escape rates for Gibbs measures
• Expanding Maps on Sets Which are Almost Invariant: Decay and Chaos
• Nonuniform hyperbolicity. Dynamics of systems with nonzero Lyapunov exponents
• Open circle maps: small hole asymptotics
• Pattern Avoidance and Overlap in Strings
• Rare events, escape rates and quasistationarity: Some Exact formulae
• Statistical properties of dynamical systems with some hyperbolicity
• String overlaps, pattern matching, and nontransitive games
• The optimal sink and the best source in a Markov chain
• Where to place a hole to achieve a maximal escape rate
• Which hole is leaking the most: a topological approach to study open systems

Cited in

(4)

• Frenesy: time-symmetric dynamical activity in nonequilibria
• SUBSHIFTS OF FINITE TYPE WITH A HOLE
• A stream cipher algorithm based on 2D coupled map lattice and partitioned cellular automata
• Indistinguishable states. II: The imperfect model scenario

This page was built for publication: Where and when orbits of chaotic systems prefer to go

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632035)