Variations of the elephant random walk

Variations of the elephant random walk
复制标题

大象随机游走的变体

DOI:
--
复制
发表时间:
2018
影响因子:
1
通讯作者:
U. Stadtmüller
U. Stadtmüller
中科院分区:
数学4区
文献类型:
--
作者:
A. Gut;U. Stadtmüller

文献摘要

被引文献

相似文献

摘要经典简单随机游动的步数是独立的,即步行者没有记忆。相比之下,在Schütz和Trimper于2004年引入的大象随机行走中,下一步总是取决于到目前为止的整个路径。我们的主要目的是证明类似的结果时,大象只有一个有限的记忆,例如只记得最遥远的步骤(S),最近的步骤(S),或两者兼而有之。我们还扩展了模型,以涵盖更一般的步长。
Abstract In the classical simple random walk the steps are independent, that is, the walker has no memory. In contrast, in the elephant random walk, which was introduced by Schütz and Trimper [19] in 2004, 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.