2000 character limit reached
How often can two independent elephant random walks on $\mathbb{Z}$ meet? (2404.13490v1)
Published 21 Apr 2024 in math.PR
Abstract: We show that two independent elephant random walks on the integer lattice $\mathbb{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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.