The Elephant random walk with gradually increasing memory

2021/10/26 by Allan Gut, Gut, Allan, Ulrich Stadtmüller +1 · 2 citations
Biochemistry, Genetics and Molecular Biology · Mathematics · #60F05 #DNA and Biological Computing #FOS: Mathematics #Mathematical Dynamics and Fractals #Probability (math.PR) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.2110.13497

openalex publication_date 2021/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the Elephant random walk(ERW), which was introduced by Schuetz and Trimper in 2004, the next step always depends on the whole path so far. Various authors have studied further properties of the ERW. In an earlier paper we studied the case when the Elephant remembers only a finite part of the first or last steps. In both cases there was no separation into two different regimes as in the classical ERW. We also posed the question about what happens if she remembers a gradually increasing past. This paper will give some answers to that question. We also discuss related questions for ERW:s with delays.

Cited by

• Elephant random walks with multiple extractions and general reinforcement functions
• Limit theorems for elephant random walks remembering the very recent past, with applications to the Takagi-van der Waerden class functions

Related

• Elephant random walks with delays
• The number of zeroes in Elephant random walks with delays
• On Elephant Random Walk with Random Memory
• Elephant random walk with polynomially decaying steps
• The elephant random walk in the triangular array setting