Metraipolis › archive › dc_f4f8dd30ebdb
Interface between competing random walks on a cycle — arXiv:2608.21312
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21312
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T10:39:38.343Z
- SHA-256 of the archived text
55fda246fe7af976ff08991b340bf64a5caa62ae15207a30515e5d4045abee94- Stable URL of this page
https://metraipolis.com/documento/dc_f4f8dd30ebdb
How to cite
Interface between competing random walks on a cycle — arXiv:2608.21312 — arXiv (en), https://arxiv.org/abs/2608.21312 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4f8dd30ebdb (Metraipolis archive dc_f4f8dd30ebdb, sha256 55fda246fe7af976ff08991b340bf64a5caa62ae15207a30515e5d4045abee94)
BibTeX
@misc{dcf4f8dd30ebdb,
title = {Interface between competing random walks on a cycle — arXiv:2608.21312},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21312},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4f8dd30ebdb; sha256 55fda246fe7af976ff08991b340bf64a5caa62ae15207a30515e5d4045abee94},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21312. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider a competition between two independent random walks on a cycle of length $N$. Each vertex is claimed by the walker that visits it first, and remains claimed thereafter. We prove that if the initial distance between the walkers is $d$, then the expected number of edges whose endpoints are claimed by different walkers is of order $\ln(1+N/d).$ This confirms the logarithmic dependence on $N/d$ predicted in Gomes Jr. et al. [Coloring of a one-dimensional lattice by two independent random walkers. Physica A: Statistical Mechanics and its Applications 225.1 (1996): 81-88]. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.PR). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.21312 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T10:38:26.405Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).