Critical random graphs: limiting constructions and distributional properties
We consider the Erdo{double acute}s-Rényi random graph G(n, p) inside the critical window, where p = 1/n + λn-4/3 for some λ ∈ R. We proved in Addario-Berry et al. [2009+] that considering the connected components of G(n, p) as a sequence of metric spaces with the graph distance rescaled by n-1/3 an...
Main Authors: | , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|