betaFeedback

WorksMathematics

The elephant random walk with proportionally growing recent memory

Abstract

In this work, we study an elephant random walk with recent restricted memory, where at step nn the elephant remembers only the last mn=max⁡{⌊cn⌋,1}m_n=\max\{\lfloor cn\rfloor,1\} steps for c∈(0,1)c\in(0,1). We show that the random walk undergoes a phase transition at the critical point pc=(3+1−c)/4p_c=(3+\sqrt{1-c})/4, which depends on the memory proportion cc. For 0<p<pc0<p<p_c, Sn/nS_n/\sqrt{n} is asymptotically normal; for p=pcp=p_c, Sn/nlog⁡nS_n/\sqrt{n\log n} is asymptotically normal; and for pc<p<1p_c<p<1, Sn/nρS_n/n^ρ converges almost surely and in L2L^2 to a random variable for some constant ρ∈(1/2,1)ρ\in (1/2, 1). This phase transition differs from that of the classical elephant random walk and its remote-memory counterpart, both of which have the same fixed critical point 3/43/4.

Paper details

vlnc:W_gtt4263j
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…