학술논문

How often can two independent elephant random walks on $\mathbb{Z}$ meet?
Document Type
Working Paper
Source
Subject
Mathematics - Probability
Language
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.
Comment: 4 pages