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...
Главные авторы: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2009
|
Схожие документы
-
Duality in inhomogeneous random graphs, and the cut metric
по: Janson, S, и др.
Опубликовано: (2009) -
Sparse graphs: metrics and random models
по: Bollobas, B, и др.
Опубликовано: (2008) -
Sparse random graphs with clustering
по: Bollobas, B, и др.
Опубликовано: (2008) -
The phase transition in inhomogeneous random graphs
по: Bollobas, B, и др.
Опубликовано: (2005) -
Metrics for sparse graphs
по: Bollobas, B, и др.
Опубликовано: (2007)