The cut metric, random graphs, and branching processes
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the sequence of matrices of edge probabilities converges to an app...
Auteurs principaux: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
2009
|
Documents similaires
-
Duality in inhomogeneous random graphs, and the cut metric
par: Janson, S, et autres
Publié: (2009) -
Sparse graphs: metrics and random models
par: Bollobas, B, et autres
Publié: (2008) -
Sparse random graphs with clustering
par: Bollobas, B, et autres
Publié: (2008) -
The phase transition in inhomogeneous random graphs
par: Bollobas, B, et autres
Publié: (2005) -
Metrics for sparse graphs
par: Bollobas, B, et autres
Publié: (2007)