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...
Main Authors: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2009
|
Similar Items
-
Duality in inhomogeneous random graphs, and the cut metric
by: Janson, S, et al.
Published: (2009) -
Sparse graphs: metrics and random models
by: Bollobas, B, et al.
Published: (2008) -
Sparse random graphs with clustering
by: Bollobas, B, et al.
Published: (2008) -
The phase transition in inhomogeneous random graphs
by: Bollobas, B, et al.
Published: (2005) -
Metrics for sparse graphs
by: Bollobas, B, et al.
Published: (2007)