Scaling limit for the random walk on the largest connected component of the critical random graph (Q435221): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1210.5865 / rank | |||
Normal rank | |||
Revision as of 13:41, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scaling limit for the random walk on the largest connected component of the critical random graph |
scientific article |
Statements
Scaling limit for the random walk on the largest connected component of the critical random graph (English)
0 references
11 July 2012
0 references
Summary: A scaling limit for the simple random walk on the largest connected component of the Erdős-Ré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.
0 references
random graphs
0 references
random walk in random environment
0 references
scaling limit
0 references
continuum random tree
0 references
