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...
Hoofdauteurs: | Addario-Berry, L, Broutin, N, Goldschmidt, C |
---|---|
Formaat: | Journal article |
Taal: | English |
Gepubliceerd in: |
2010
|
Gelijkaardige items
-
The continuum limit of critical random graphs
door: Addario-Berry, L, et al.
Gepubliceerd in: (2012) -
The continuum limit of critical random graphs
door: Addario-Berry, L, et al.
Gepubliceerd in: (2012) -
The scaling limit of the minimum spanning tree of the complete graph
door: Addario-Berry, L, et al.
Gepubliceerd in: (2017) -
The scaling limit of a critical random directed graph
door: Goldschmidt, C, et al.
Gepubliceerd in: (2023) -
The Diameter of the Minimum Spanning Tree of a Complete Graph
door: Louigi Addario-Berry, et al.
Gepubliceerd in: (2006-01-01)