We consider the Erdös-Rényi random graph $G(n,p)$ inside the critical window, where $p=1/n+\lambda n^{-4/3}$ for some $\lambda\in\mathbb{R}$. We proved in [1] that considering the connected components of $G(n,p)$ as a sequence of metric spaces with the graph distance rescaled by…
Fecha:
2010-01-01
Recurso:
Electronic journal of probability
CIC - Centro de Información y Conocimiento Johannes Gutenberg ®