How often can two independent elephant random walks on $\mathbb{Z}$ meet?
Rahul Roy, Masato Takei, Hideki Tanemura

TL;DR
This paper investigates the meeting frequency of two independent elephant random walks on the integer lattice, revealing a phase transition at the memory parameter $p=3/4$ and providing asymptotic behavior of their distance.
Contribution
It establishes a clear criterion based on the memory parameter for whether the walks meet finitely or infinitely often, and derives asymptotic results for their separation.
Findings
Finitely or infinitely often meeting depends on whether p > 3/4.
Asymptotic behavior of the distance between the walks is characterized.
Phase transition at p=3/4 for the recurrence of meetings.
Abstract
We show that two independent elephant random walks on the integer lattice meet each other finitely often or infinitely often depends on whether the memory parameter is strictly larger than or not. Asymptotic results for the distance between them are also obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Mathematical Dynamics and Fractals · semigroups and automata theory
