Scaling limit for the random walk on the largest connected component of the critical random graph

From MaRDI portal
Publication:435221




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.









This page was built for publication: Scaling limit for the random walk on the largest connected component of the critical random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435221)