Monotonicity of the speed for biased random walk on Galton-Watson tree
Probability
2016-10-27 v1
Abstract
Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk on a Galton-Watson tree without leaves is strictly decreasing for where is minimal degree of the Galton-Watson tree. And A\"{\i}d\'{e}kon \cite{EA2013} improved this result to In this paper, we prove that for the on a Galton-Watson tree without leaves, its speed is strictly decreasing for when and we owe the proof to A\"{\i}d\'{e}kon \cite{EA2013}.
Cite
@article{arxiv.1610.08151,
title = {Monotonicity of the speed for biased random walk on Galton-Watson tree},
author = {Song He and Wang Longmin and Xiang Kainan},
journal= {arXiv preprint arXiv:1610.08151},
year = {2016}
}