Statistical and Deterministic Dynamics of Maps with Memory

preprint2016arXivOpen access

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α(xn−1,xn)=τ(α⋅xn+(1−α)⋅xn−1),x_{n+1}=T_α(x_{n-1},x_{n})=τ(α\cdot x_{n}+(1-α)\cdot x_{n-1}), where ττ is a one-dimensional map on I=[0,1]I=[0,1] and 0<α<10<α<1 determines how much memory is being used. TαT_α does not define a dynamical system since it maps U=I×IU=I\times I into II. In this note we let ττ to be the symmetric tent map. We shall prove that for 0<α<0.46,0<α<0.46, the orbits of {xn}\{x_{n}\} are described statistically by an absolutely continuous invariant measure (acim) in two dimensions. As αα 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α=0.5, all points have period 3 or eventually possess period 3. For 0.5<α<0.750.5<α<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,α=0.75, we have slightly more complicated periodic behavior.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.