Abstract
We show that two independent elephant random walks on the integer lattice $\mathbf{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.
Citation
Rahul Roy. Masato Takei. Hideki Tanemura. "How often can two independent elephant random walks on $\mathbf{Z}$ meet?." Proc. Japan Acad. Ser. A Math. Sci. 100 (10) 57 - 59, December 2024. https://doi.org/10.3792/pjaa.100.012
Information
