Explicit dynamical properties of the Pelikan random map in the chaotic region and at the intermittent critical point towards the non-chaotic region
Abstract
The Pelikan random trajectories xt ∈ [0,1[ are generated by choosing the chaotic doubling map xt+1=2 xt [mod 1] with probability p and the non-chaotic half-contracting map xt+1=xt2 with probability (1-p). We compute various dynamical observables as a function of the parameter p via two perspectives. In the first perspective, we focus on the closed dynamics within the subspace of probability densities that remain constant on the binary-intervals x ∈ [ 2-n-1, 2-n[ partitioning the interval x ∈ [0,1[ : the dynamics for the weights πt(n) of these intervals corresponds to a biased random walk on the half-infinite lattice n ∈ \0,1,2,..+∞\ with resetting occurring with probability p from the origin n=0 towards any site n drawn with the distribution 2-n-1. In the second perspective, we study the Pelikan dynamics for any initial condition x0 via the binary decomposition xt = Σl=1+∞ σl (t)2l , where the dynamics for the half-infinite lattice l=1,2,.. of the binary variables σl(t) ∈ \0,1\ can be reformulated in terms of two global variables : zt corresponds to a biased random walk on the half-infinite lattice z ∈ \0,1,2,..+∞\ that may remain at the origin z=0 with probability p, while Ft ∈ \0,1,2,..t\ counts the number of time-steps τ ∈ [0,t-1] where zτ+1=0=zτ and represents the number of the binary coefficients of the initial condition that have been erased. We discuss typical and large deviations properties in the chaotic region 12<p<1 as well as at the intermittent critical point pc=12 towards the non-chaotic region 0<p<12.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.