Metraipolis › archive › dc_6aed87112372
A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range — arXiv:2609.29894
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29894
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:07:51.697Z
- SHA-256 of the archived text
6b907f3d1bdb070da32b6f40e888213d26b72ef391ded6fe2194658015d49077- Stable URL of this page
https://metraipolis.com/documento/dc_6aed87112372
How to cite
A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range — arXiv:2609.29894 — arXiv (en), https://arxiv.org/abs/2609.29894 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6aed87112372 (Metraipolis archive dc_6aed87112372, sha256 6b907f3d1bdb070da32b6f40e888213d26b72ef391ded6fe2194658015d49077)
BibTeX
@misc{dc6aed87112372,
title = {A Computer-Assisted Proof of Speed Monotonicity for the Biased Random Walk on a Galton-Watson Tree Beyond the Known Range — arXiv:2609.29894},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29894},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6aed87112372; sha256 6b907f3d1bdb070da32b6f40e888213d26b72ef391ded6fe2194658015d49077},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29894. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The speed v(lambda) of the lambda-biased random walk on a supercritical Galton-Watson tree without leaves is conjectured to be nonincreasing on [0,m), where m is the mean offspring. For non-constant offspring, monotonicity is known only for small bias: lambda <= 1/1160, lambda <= 1/2, and, when every vertex has at least m_1 >= 2 children, lambda <= m_1/(1+sqrt(1-1/m_1)). For offspring uniform on {2,3} (m=2.5) the last bound is 2/(1+sqrt(1/2)) = 1.17157... We prove, with computer assistance, that v is strictly decreasing on [0,1.755] for this law. The proof has three parts. Aidekon's speed formula gives v=(R-lambda)/(R+lambda) for an explicit functional R, so v decreases exactly when R/lambda does; we compare R/lambda at two biases directly, which avoids differentiating the conductance. A pathwise Lipschitz bound on the conductance in lambda turns that comparison into an inequality between expectations of explicit functions. A monotone sandwich of discretised laws gives two-sided bounds on the conductance law, and each lambda-cell is verified with exact rational arithmetic on top of bounded floating-point error; an independent interval-arithmetic implementation re-certifies five cells, including the one that sets the endpoint. The method stops where the crude Lipschitz bound becomes too weak; sharper control of the derivative of the conductance is what the full range needs. Code and certificates are public.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.29894 — 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-08T05:35:05.150Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).