2000 character limit reached
Differentiability of the speed of biased random walks on Galton-Watson trees (1906.07913v2)
Published 19 Jun 2019 in math.PR
Abstract: We prove that the speed of a $\lambda$-biased random walk on a supercritical Galton-Watson tree is differentiable for $\lambda$ such that the walk is ballistic and obeys a central limit theorem, 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.
Collections
Sign up for free to add this paper to one or more collections.