
























In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Schütz 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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。