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

From MaRDI portal
Publication:435221

DOI10.2977/PRIMS/70zbMATH Open1244.82070arXiv1210.5865OpenAlexW2046857250MaRDI QIDQ435221FDOQ435221


Authors: David A. Croydon Edit this on Wikidata


Publication date: 11 July 2012

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1210.5865




Recommendations




Cites Work


Cited In (9)





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)