English

Statistical and Deterministic Dynamics of Maps with Memory

Dynamical Systems 2016-04-26 v1

Abstract

We consider a dynamical system to have memory if it remembers the current state as well as the state before that. The dynamics is defined as follows: xn+1=Tα(xn1,xn)=τ(αxn+(1α)xn1),x_{n+1}=T_{\alpha}(x_{n-1},x_{n})=\tau (\alpha \cdot x_{n}+(1-\alpha)\cdot x_{n-1}), where τ\tau is a one-dimensional map on I=[0,1]I=[0,1] and 0<α<10<\alpha <1 determines how much memory is being used. TαT_{\alpha} does not define a dynamical system since it maps U=I×IU=I\times I into II. In this note we let τ\tau to be the symmetric tent map. We shall prove that for 0<α<0.46,0<\alpha <0.46, the orbits of {xn}\{x_{n}\} are described statistically by an absolutely continuous invariant measure (acim) in two dimensions. As α\alpha approaches 0.50.5 from below, that is, as we approach a balance between the memory state and the present state, the support of the acims become thinner until at α=0.5\alpha =0.5, all points have period 3 or eventually possess period 3. For 0.5<α<0.750.5<\alpha <0.75, we have a global attractor: for all starting points in UU except (0,0)(0,0), the orbits are attracted to the fixed point (2/3,2/3).(2/3,2/3). At α=0.75,\alpha=0.75, we have slightly more complicated periodic behavior.

Keywords

Cite

@article{arxiv.1604.06991,
  title  = {Statistical and Deterministic Dynamics of Maps with Memory},
  author = {Paweł Góra and Abraham Boyarsky and Zhenyang Li and Harald Proppe},
  journal= {arXiv preprint arXiv:1604.06991},
  year   = {2016}
}

Comments

37 pages

R2 v1 2026-06-22T13:39:27.314Z