The Speed of a Biased Walk on a Galton-Watson Tree without Leaves is Monotonic with Respect to Progeny Distributions for High Values of Bias
Abstract
Consider biased random walks on two Galton-Watson trees without leaves having progeny distributions P1 and P2 (GW(P1) and GW(P2)) where P1 and P2 are supported on positive integers and P1 dominates P2 stochastically. We prove that the speed of the walk on GW(P1) is bigger than the same on GW(P2) when the bias is larger than a threshold depending on P1 and P2. This partially answers a question raised by Ben Arous, Fribergh and Sidoravicius.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.