论文标题
大象随机步行中的零数量随延迟
The number of zeroes in Elephant random walks with delays
论文作者
论文摘要
在简单的随机步行中，步骤是独立的，而在Schütz和Trimper在2004年引入的大象随机步行（ERW）中，下一步始终取决于到目前为止的整个路径。在较早的论文中，当大象的记忆力受限时，我们调查了大象随机步行。受Bercu等人的建议启发。 （ARXIV：1902.11220V1）我们将结果扩展到允许延迟的情况。在本文中，我们研究了随着时间的流逝，延迟数量（可能停止过程）的增加是如何增加的。
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.
