How often can two independent elephant random walks on $\mathbb{Z}$ meet?
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911847640203264 |
|---|---|
| author | Roy, Rahul Takei, Masato Tanemura, Hideki |
| author_facet | Roy, Rahul Takei, Masato Tanemura, Hideki |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_13490 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | How often can two independent elephant random walks on $\mathbb{Z}$ meet? Roy, Rahul Takei, Masato Tanemura, Hideki Probability 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. |
| title | How often can two independent elephant random walks on $\mathbb{Z}$ meet? |
| topic | Probability |
| url | https://arxiv.org/abs/2404.13490 |