Statistical and Deterministic Dynamics of Maps with Memory

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), where τ is a one-dimensional map on I=[0,1] and 0<α <1 determines how much memory is being used. Tα does not define a dynamical system since it maps U=I× I into I. In this note we let τ to be the symmetric tent map. We shall prove that for 0<α <0.46, the orbits of \xn\ are described statistically by an absolutely continuous invariant measure (acim) in two dimensions. As α approaches 0.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, all points have period 3 or eventually possess period 3. For 0.5<α <0.75, we have a global attractor: for all starting points in U except (0,0), the orbits are attracted to the fixed point (2/3,2/3). At α=0.75, we have slightly more complicated periodic behavior.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…