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...
Үндсэн зохиолчид: | Addario-Berry, L, Broutin, N, Goldschmidt, C |
---|---|
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
2010
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
The continuum limit of critical random graphs
-н: Addario-Berry, L, зэрэг
Хэвлэсэн: (2012) -
The continuum limit of critical random graphs
-н: Addario-Berry, L, зэрэг
Хэвлэсэн: (2012) -
The scaling limit of the minimum spanning tree of the complete graph
-н: Addario-Berry, L, зэрэг
Хэвлэсэн: (2017) -
The scaling limit of a critical random directed graph
-н: Goldschmidt, C, зэрэг
Хэвлэсэн: (2023) -
The Diameter of the Minimum Spanning Tree of a Complete Graph
-н: Louigi Addario-Berry, зэрэг
Хэвлэсэн: (2006-01-01)