arXiv Analytics

Sign in

arXiv:1610.08151 [math.PR]AbstractReferencesReviewsResources

Monotonicity of the speed for biased random walk on Galton-Watson tree

Song He, Wang Longmin, Xiang Kainan

Published 2016-10-26Version 1

Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk $RW_\lambda$ on a Galton-Watson tree without leaves is strictly decreasing for $\lambda\leq \frac{m_1}{1160},$ where $m_1$ is minimal degree of the Galton-Watson tree. And A\"{\i}d\'{e}kon \cite{EA2013} improved this result to $\lambda\leq \frac{1}{2}.$ In this paper, we prove that for the $RW_{\lambda}$ on a Galton-Watson tree without leaves, its speed is strictly decreasing for $\lambda\in \left[0,\frac{m_1}{1+\sqrt{1-\frac{1}{m_1}}}\right]$ when $m_1\geq 2;$ and we owe the proof to A\"{\i}d\'{e}kon \cite{EA2013}.

Related articles: Most relevant | Search more
arXiv:1111.4313 [math.PR] (Published 2011-11-18, updated 2013-01-18)
Speed of the biased random walk on a Galton--Watson tree
arXiv:1502.02831 [math.PR] (Published 2015-02-10)
The most visited sites of biased random walks on trees
arXiv:0711.3686 [math.PR] (Published 2007-11-23, updated 2010-11-17)
Biased random walks on a Galton-Watson tree with leaves