Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph
Publications of the Research Institute for Mathematical Sciences · 03.06.2012 · 48 (2) · 279-338
DOI: 10.2977/prims/70 ↗Kurz gefasst
Fachartikel in der Zeitschrift Publications of the Research Institute for Mathematical Sciences, erschienen am 03.06.2012. Verfasst von David A. Croydon. Die Arbeit wurde bisher 12-mal zitiert (Crossref).
Abstract (Originalsprache)
A scaling limit for the simple random walk on the largest connected component of the Erd\H{o}s-R\'{e}nyi random graph G(n,p) in the critical window, p=n^{-1}+\lambda n^{-4/3} , 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.
Zitieren
APA
Croydon, D. A. (2012). Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph. Publications of the Research Institute for Mathematical Sciences, 48(2), 279-338. https://doi.org/10.2977/prims/70
Vancouver
Croydon DA. Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph. Publications of the Research Institute for Mathematical Sciences. 2012;48(2):279-338. doi:10.2977/prims/70
BibTeX
@article{Croydon2012,
author = {Croydon, David A.},
title = {Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph},
journal = {Publications of the Research Institute for Mathematical Sciences},
year = {2012},
volume = {48},
number = {2},
pages = {279--338},
doi = {10.2977/prims/70}
}
EUVIMED