Where and when orbits of chaotic systems prefer to go

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) ξ 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 ξ 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 ξ 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.

Frenesy: Time-symmetric dynamical activity in nonequilibria

“…In [133] it was shown that for very chaotic systems (the most uniformly hyperbolic dynamic) escape rates are indeed generally different for different holes and relations between corresponding survival probabilities can be established for all moments of time. We refer to [134] for the first rigorous results in the mathematical theory of finite time dynamics of (strongly) chaotic systems.…”

Subshifts of Finite Type With a Hole

“…A question of general interest is to explore other factors that influence the escape rate into the hole other than the length, the number of corresponding forbidden words, and the minimum period of the hole. In [2], Bolding and Bunimovich discuss finite-time dynamical properties of the shift map on a full shift with cylinders as holes. For each , they compare the values of , the number of words of length n which end with w but do not contain w as subwords in any other place.…”

“…Open dynamical systems or dynamical systems with a hole are of interest because of their dynamical properties and also their applications; see [2, 5, 7, 9]. In [16], Pianigiani and Yorke introduced such systems and also discussed the issue of the rate of the escape of orbits into the hole (known as the escape rate ).…”