Metraipolis › archive › dc_8fc64b0d280c
Uniform Bessel bounds for endpoint crossings in the persistent random walk — arXiv:2610.06935
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06935
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:50:53.175Z
- SHA-256 of the archived text
56618159a300e569aaa7b9bf838b5e8424e5ffc17891a735ba2aa187e8af50c4- Stable URL of this page
https://metraipolis.com/documento/dc_8fc64b0d280c
How to cite
Uniform Bessel bounds for endpoint crossings in the persistent random walk — arXiv:2610.06935 — arXiv (en), https://arxiv.org/abs/2610.06935 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fc64b0d280c (Metraipolis archive dc_8fc64b0d280c, sha256 56618159a300e569aaa7b9bf838b5e8424e5ffc17891a735ba2aa187e8af50c4)
BibTeX
@misc{dc8fc64b0d280c,
title = {Uniform Bessel bounds for endpoint crossings in the persistent random walk — arXiv:2610.06935},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06935},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fc64b0d280c; sha256 56618159a300e569aaa7b9bf838b5e8424e5ffc17891a735ba2aa187e8af50c4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06935. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A ball bounces down a Galton board, where its first bounce's direction is fair while every later bounce repeats the previous bounce's direction with probability $p$, all the way down to some bin. We ask for which $p$ the middle bin is exactly as likely as the end bins, a question originally posed by Kagey. We find that for $N$ bounces, the tie occurs when the ball changes direction (turns) approximately $\log N$ times on average. We compare the central bin with a Bessel function, with an error bound that is explicit for all $N$. This yields an explicit interval for the tie at every $N \geq 2$, rather than just for large $N$. This is done analytically for $N \geq 175$, and for smaller $N$ exactly by integer arithmetic, cross-verified in Lean. We also find the tie of every other bin with the end bins and the shift caused by periodic boundaries. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Probability (math.PR) ; Statistical Mechanics (cond-mat.stat-mech). Pagina del lavoro: https://arxiv.org/abs/2610.06935 — 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-07T11:21:39.611Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).