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...
Hoofdauteurs: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Formaat: | Journal article |
Taal: | English |
Gepubliceerd in: |
2009
|
Gelijkaardige items
-
Duality in inhomogeneous random graphs, and the cut metric
door: Janson, S, et al.
Gepubliceerd in: (2009) -
Sparse graphs: metrics and random models
door: Bollobas, B, et al.
Gepubliceerd in: (2008) -
Sparse random graphs with clustering
door: Bollobas, B, et al.
Gepubliceerd in: (2008) -
The phase transition in inhomogeneous random graphs
door: Bollobas, B, et al.
Gepubliceerd in: (2005) -
Metrics for sparse graphs
door: Bollobas, B, et al.
Gepubliceerd in: (2007)