Convergence of simple random walks on random discrete trees to Brownian motion on the continuum random tree (Q731714): Difference between revisions

It is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walk on any family of discrete \(n\)-vertex ordered graph trees whose search-depth functions converge to the Brownian excursion as \(n\rightarrow \infty \). The author prove both a quenched version (for typical realisations of the trees) and an annealed version (averaged over all realisations of the trees) of this result. The assumptions made cover the case of simple random walk on the trees generated by the Galton-Watson branching process, conditioned on the total population size.