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\"ıdé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\"ıdékon \cite{EA2013}.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.