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...
Váldodahkkit: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Materiálatiipa: | Journal article |
Giella: | English |
Almmustuhtton: |
2009
|
Geahča maid
-
Duality in inhomogeneous random graphs, and the cut metric
Dahkki: Janson, S, et al.
Almmustuhtton: (2009) -
Sparse graphs: metrics and random models
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2008) -
Sparse random graphs with clustering
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2008) -
Metrics for sparse graphs
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2007) -
The phase transition in inhomogeneous random graphs
Dahkki: Bollobas, B, et al.
Almmustuhtton: (2005)