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

Rahul Roy, Masato Takei, Hideki Tanemura

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)57-59
Number of pages3
JournalProceedings of the Japan Academy Series A: Mathematical Sciences
Volume100
Issue number10
DOIs
Publication statusPublished - 2024

Keywords

  • Elephant random walks
  • Random walks with memory
  • Self-interacting random walks

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'How often can two independent elephant random walks on Z meet?'. Together they form a unique fingerprint.

Cite this