2000 character limit reached
Regularity results of the speed of biased random walks on Galton-Watson trees (1811.04849v2)
Published 12 Nov 2018 in math.PR
Abstract: We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random variable. The proof heavily uses the renewal structure of Galton-Watson trees that was introduced by Lyons-Pemantle-Peres.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.