pith. sign in

arxiv: 1210.5865 · v1 · pith:4TKP7Y2Qnew · submitted 2012-10-22 · 🧮 math.PR

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

classification 🧮 math.PR
keywords randomcomponentconnectedcriticalgraphlargestlimitscaling
0
0 comments X
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.