2000 character limit reached
The speed of a biased random walk on a Galton-Watson tree is analytic
Published 4 Jun 2020 in math.PR | (2006.03433v2)
Abstract: We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is differentiable within the range of bias for which a central limit theorem holds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.