On the Monotonicity of the Speed of Biased Random Walks on GW Trees
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
On a Galton--Watson tree without leaves, the -biased random walk chooses its next step with weight for the parent and weight one for each child. When strictly less than the mean offspring , the walk is transient, with a positive speed We study the monotonicity of , and prove that:
\begin{itemize}
\item If the GW tree has at least two children, then is decreasing on ;
\item is decreasing on .
\end{itemize}
We also sketch a computer-assisted proof of strict decrease on using exact checks of about rational coefficients. The full proof appears in the companion GitHub version~\cite{FullVersion}.
Provenance statement
Tools used
- OpenAI
- ChatGPTVersion 6 Astra
References
- Aïdékon, Élie. Speed of the biased random walk on a Galton–Watson tree. Probability Theory and Related Fields, vol. 159, pp. 597–617. 2014. Theorem numbering follows arXiv:1111.4313v4 (https://arxiv.org/abs/1111.4313v4)arXivDOI
- Bowditch, Adam; Tokushige, Yuki. Differentiability of the speed of biased random walks on Galton–Watson trees. ALEA. Latin American Journal of Probability and Mathematical Statistics, vol. 17, pp. 609–642. 2020. arXiv:1906.07913v2 (https://arxiv.org/abs/1906.07913v2)arXivDOI
- GPT-6 Astra; Ma, Heng. Monotonicity of the Speed of Biased Random Walks on Galton–Watson Trees: full (GitHub) version. 2026. Companion full manuscript, November 20, 2026, Section 6. Complete proofs and accompanying exact-computation supplement. https://github.com/hengmamath/monotone-speed-biased-RW/blob/main/paper/github.pdflink
- GPT-6 Astra; Ma, Heng. Supplementary exact computations and source records for speed monotonicity. 2026. Exact coefficient data, executable verification programs and source records accompanying this article. See the supplementary README for the correspondence with the finite arithmetic lemmas. https://github.com/hengmamath/monotone-speed-biased-RW/tree/main/paper/supplementlink
- Lyons, Russell; Pemantle, Robin; Peres, Yuval. Unsolved problems concerning random walks on trees. Classical and Modern Branching Processes, vol. 84, pp. 223–238. 1997. Corrected author version (https://rdlyons.pages.iu.edu/pdf/opentree7.pdf), Question 2.1link
- Schwarzfischer, Felix. A proof of the Lyons–Pemantle–Peres monotonicity conjecture for high offspring laws. 2026. Submitted November 19, 2026; Theorem 1.1 and the discussion following it. arXiv:2611.25882v1 (https://arxiv.org/abs/2611.25882v1)link
- Song, He; Wang, Longmin; Xiang, Kainan. Monotonicity of speed for biased random walk on Galton–Watson tree. 2016. Theorem 1.2, Lemma 2.1, equation (2.1), and Lemma 2.5. arXiv:1610.08151v1 (https://arxiv.org/abs/1610.08151v1)link