Variations of the elephant random walk
arXiv:1812.01915 · doi:10.1017/jpr.2021.3
Abstract
In the classical simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk which was introduced by Schütz and Trimper in 2004, the walker remembers the whole past, and the next step always depends on the whole path so far. Our main aim is to prove analogous results when the elephant has only a restricted memory, for example remembering only the most remote step(s), the most recent step(s) or both. We also extend the models to cover more general step sizes.
arXiv comment22 pages
References in corpus (6)
- Elephants can always remember: Exact long-range memory effects in a non-Markovian random walk
- A martingale approach for the elephant random walk
- Central Limit Theorem for the Elephant Random Walk
- Amnestically induced persistence in random walks
- Finite-Memory Elephant Random Walk and the Central Limit Theorem for Additive Functionals
- Random walks avoiding their convex hull with a finite memory