Variations of the elephant random walk

From MaRDI portal
Publication:5152525

DOI10.1017/JPR.2021.3zbMATH Open1479.60049arXiv1812.01915OpenAlexW3200032055MaRDI QIDQ5152525FDOQ5152525


Authors: Ulrich Stadtmüller, Allan Gut Edit this on Wikidata


Publication date: 24 September 2021

Published in: Journal of Applied Probability (Search for Journal in Brave)

Abstract: In the classical simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk which was introduced by Sch"utz and Trimper in 2004, the walker remembers the whole past, and the next step always depends on the whole path so far. Our main aim is to prove analogous results when the elephant has only a restricted memory, for example remembering only the most remote step(s), the most recent step(s) or both. We also extend the models to cover more general step sizes.


Full work available at URL: https://arxiv.org/abs/1812.01915




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Variations of the elephant random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152525)