The number of zeros in Elephant random walks with delays
Allan Gut and
Statistics & Probability Letters, 2021, vol. 174, issue C
In the simple random walk the steps are independent, whereas in the elephant random walk (ERW), which was introduced by Schütz and Trimper (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. (2019) 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: Elephant random walk; Delay; Number of zeros; Law of large numbers; Central limit theorem; Markov chain (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:174:y:2021:i:c:s0167715221000742
Ordering information: This journal article can be ordered from
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul
More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().