arXiv Analytics

Sign in

arXiv:1906.07913 [math.PR]AbstractReferencesReviewsResources

Differentiability of the speed of biased random walks on Galton-Watson trees

Adam Bowditch, Yuki Tokushige

Published 2019-06-19Version 1

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.

Related articles: Most relevant | Search more
arXiv:math/0606625 [math.PR] (Published 2006-06-24)
A Central Limit Theorem for biased random walks on Galton-Watson trees
arXiv:2210.07859 [math.PR] (Published 2022-10-14)
Biased Random Walk on Spanning Trees of the Ladder Graph
arXiv:2006.03433 [math.PR] (Published 2020-06-04)
The speed of a biased random walk on a Galton-Watson tree is analytic