TY - JOUR
T1 - How often can two independent elephant random walks on Z meet?
AU - Roy, Rahul
AU - Takei, Masato
AU - Tanemura, Hideki
N1 - Publisher Copyright:
© (2024), (Japan Academy). All rights reserved.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
KW - Elephant random walks
KW - Random walks with memory
KW - Self-interacting random walks
UR - http://www.scopus.com/inward/record.url?scp=85214141401&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85214141401&partnerID=8YFLogxK
U2 - 10.3792/PJAA.100.012
DO - 10.3792/PJAA.100.012
M3 - Article
AN - SCOPUS:85214141401
SN - 0386-2194
VL - 100
SP - 57
EP - 59
JO - Proceedings of the Japan Academy Series A: Mathematical Sciences
JF - Proceedings of the Japan Academy Series A: Mathematical Sciences
IS - 10
ER -