English

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 RWλRW_\lambda on a Galton-Watson tree without leaves is strictly decreasing for λm11160,\lambda\leq \frac{m_1}{1160}, where m1m_1 is minimal degree of the Galton-Watson tree. And A\"{\i}d\'{e}kon \cite{EA2013} improved this result to λ12.\lambda\leq \frac{1}{2}. In this paper, we prove that for the RWλRW_{\lambda} on a Galton-Watson tree without leaves, its speed is strictly decreasing for λ[0,m11+11m1]\lambda\in \left[0,\frac{m_1}{1+\sqrt{1-\frac{1}{m_1}}}\right] when m12;m_1\geq 2; and we owe the proof to A\"{\i}d\'{e}kon \cite{EA2013}.

Keywords

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}
}