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

2024/04/21 by Rahul Roy, Roy, Rahul, Masato Takei +3
Computer Science · Mathematics · #Algorithms and Data Compression #Mathematical Dynamics and Fractals #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2404.13490

Abstract

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 p is strictly larger than 3/4 or not. Asymptotic results for the distance between them are also obtained.

Related

• A remark on elephant random walks via the classical law of the iterated logarithm for self-similar Gaussian processes
• Elephant random walks with graph based shared memory: First and second order asymptotics
• Asymptotic Analysis of the Elephant Random Walk
• Recurrence and transience of multidimensional elephant random walks
• Phase transitions for a unidirectional elephant random walk with a power law memory