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

preprint2016arXivOpen access

Abstract

Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk RWλRW_λ on a Galton-Watson tree without leaves is strictly decreasing for λ≤m11160,λ\leq \frac{m_1}{1160}, where m1m_1 is minimal degree of the Galton-Watson tree. And A\"ıdékon \cite{EA2013} improved this result to λ≤12.λ\leq \frac{1}{2}. In this paper, we prove that for the RWλRW_λ on a Galton-Watson tree without leaves, its speed is strictly decreasing for λ∈[0,m11+1−1m1]λ\in \left[0,\frac{m_1}{1+\sqrt{1-\frac{1}{m_1}}}\right] when m1≥2;m_1\geq 2; and we owe the proof to A\"ıdékon \cite{EA2013}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.