How often can two independent elephant random walks on Z meet?

Article Type

Research Article

Publication Title

Proceedings of the Japan Academy Series A Mathematical Sciences

Abstract

We show that two independent elephant random walks on the integer lattice 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.

First Page

57

Last Page

59

DOI

10.3792/PJAA.100.012

Publication Date

1-1-2024

Share

COinS