The number of zeroes in Elephant random walks with delays
Preprint
Abstract
In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Sch\"utz and Trimper in 2004, the next step always depends on the whole path so far. In an earlier paper we investigated Elephant Random Walks when the elephant has a restricted memory. Inspired by a suggestion by Bercu et al. (arXiv:1902.11220v1) we extended our results to the case when delays are allowed. In this paper we examine how the number of delays (that possibly stop the process) increases as time goes by.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Variations of the elephant random walkJournal of Applied Probability, 2021
- The number of zeros in Elephant random walks with delaysStatistics & Probability Letters, 2021
- Hypergeometric identities arising from the elephant random walkJournal of Mathematical Analysis and Applications, 2019
- A martingale approach for the elephant random walkJournal of Physics A: Mathematical and Theoretical, 2017
- Elephants can always remember: Exact long-range memory effects in a non-Markovian random walkPhysical Review E, 2004