The elephant random walk with gradually increasing memory

被引:7
|
作者
Gut, Allan [1 ]
Stadtmuller, Ulrich [2 ]
机构
[1] Uppsala Univ, Dept Math, Box 480, SE-75106 Uppsala, Sweden
[2] Ulm Univ, Dept Number Theory & Probabil Theory, D-89069 Ulm, Germany
关键词
Elephantrandomwalk; Graduallyincreasingmemory; Delay; Moments; Centrallimittheorem;
D O I
10.1016/j.spl.2022.109598
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk (ERW), which was introduced by Schutz and Trimper (2004), the next step always depends on the whole path so far. Various authors have studied further properties of the ERW. In Gut and Stadtmuller (2021b) we studied the case when the Elephant remembers only a finite part of the first or last steps. In both cases there was no separation into two different regimes as in the classical ERW. We also posed the question about what happens if she remembers a gradually increasing past. This paper will give some answers to that question. We also discuss related questions for ERW:s with delays. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条