Scaling limit for the random walk on the largest connected component of the critical random graph
Probability
2012-10-23 v1
Abstract
A scaling limit for the simple random walk on the largest connected component of the Erdos-Renyi random graph in the critical window is deduced. The limiting diffusion is constructed using resistance form techniques, and is shown to satisfy the same quenched short-time heat kernel asymptotics as the Brownian motion on the continuum random tree.
Keywords
Cite
@article{arxiv.1210.5865,
title = {Scaling limit for the random walk on the largest connected component of the critical random graph},
author = {David A. Croydon},
journal= {arXiv preprint arXiv:1210.5865},
year = {2012}
}