Scaling limit for the random walk on the largest connected component of the critical random graph
classification
🧮 math.PR
keywords
randomcomponentconnectedcriticalgraphlargestlimitscaling
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.