How often can two independent elephant random walks on Z meet?

被引:0
|
作者
Roy, Rahul [1 ]
Takei, Masato [2 ]
Tanemura, Hideki [3 ]
机构
[1] Indian Stat Inst, 7 SJS Sansanwal Marg, New Delhi 110016, India
[2] Yokohama Natl Univ, Dept Appl Math, Fac Engn, 79-5 Tokiwadai,Hodogaya Ku, Yokohama, Kanagawa 2408501, Japan
[3] Keio Univ, Dept Math, 3-14-1 Hiyoshi,Kohoku Ku, Yokohama, Kanagawa 2238522, Japan
关键词
Self-interacting random walks; Random walks with memory; Elephant random walks;
D O I
10.3792/pjaa.100.012
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that two independent elephant random walks on the integer lattice Z meet each other finitely often or infinitely often depends on whether the memory parameter p is strictly larger than 3/4 or not. Asymptotic results for the distance between them are also obtained.
引用
收藏
页码:57 / 59
页数:3
相关论文
共 26 条