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

Autor: ROY, RAHUL, MASATO TAKEI, HIDEKI TANEMURA
Zdroj: Proceedings of the Japan Academy, Series A: Mathematical Sciences; Dec2024, Vol. 100 Issue 10, p57-59, 3p
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index