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...
Principais autores: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado em: |
2009
|
Registros relacionados
-
Duality in inhomogeneous random graphs, and the cut metric
por: Janson, S, et al.
Publicado em: (2009) -
Sparse graphs: metrics and random models
por: Bollobas, B, et al.
Publicado em: (2008) -
Sparse random graphs with clustering
por: Bollobas, B, et al.
Publicado em: (2008) -
The phase transition in inhomogeneous random graphs
por: Bollobas, B, et al.
Publicado em: (2005) -
Metrics for sparse graphs
por: Bollobas, B, et al.
Publicado em: (2007)