Central limit theorem for a random walk on Galton-Watson trees with random conductances
Abstract: We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we study the behavior of the limiting variance as $\varepsilon\to 0$. Provided that the tree formed by larger conductances is supercritical, the variance is nonvanishing as $\varepsilon\to 0$, which implies that the slowdown induced by the $\varepsilon$-edges is not too strong. The proof utilizes a specific regeneration structure, which leads to escape estimates uniform in $\varepsilon$.
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.