The number of zeros in Elephant random walks with delays

In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Schutz 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.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  A. Gut.  Probability: A Graduate Course , 2005 .

[3]  Steffen Trimper,et al.  Elephants can always remember: exact long-range memory effects in a non-Markovian random walk. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  B. Bercu.  A martingale approach for the elephant random walk , 2017, 1707.04130.

[5]  B. Bercu,et al.  Hypergeometric identities arising from the elephant random walk , 2019, Journal of Mathematical Analysis and Applications.

[6]  A. Gut,et al.  Elephant random walks with delays. , 2019, 1906.04930.

[7]  Allan Gut,et al.  Variations of the elephant random walk , 2018, Journal of Applied Probability.