加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本