Variations of the elephant random walk
- 16 September 2021
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 58 (3) , 805-829
Abstract
In the classical simple random walk the steps are independent, that is, the walker has no memory. In contrast, in the elephant random walk, which was introduced by Schütz and Trimper [19] in 2004, 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.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Turning a Coin over Instead of Tossing ItJournal of Theoretical Probability, 2016
- Transient superdiffusion in random walks with a-exponentially decaying memory profilePhysica A: Statistical Mechanics and its Applications, 2016
- Exact solution of an anisotropic 2D random walk model with strong memory correlationsJournal of Physics A: Mathematical and Theoretical, 2013
- Urn-related random walk with drift $\rho x^\alpha / t^\beta$Electronic Journal of Probability, 2008
- Discrete-time non-Markovian random walks: The effect of memory limitations on scalingPhysica A: Statistical Mechanics and its Applications, 2006
- Elephants can always remember: Exact long-range memory effects in a non-Markovian random walkPhysical Review E, 2004
- On the Markov chain central limit theoremProbability Surveys, 2004
- A note on invariance principles for iterated random functionsJournal of Applied Probability, 2003
- The Gillis–Domb–Fisher correlated random walkJournal of Applied Probability, 1992
- Strong laws of large numbers for weakly correlated random variables.The Michigan Mathematical Journal, 1988