Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results about this extension. The basic idea is to construct the random...
Autors principals: | Bollobas, B, Janson, S, Riordan, O |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2008
|
Ítems similars
-
Sparse graphs: metrics and random models
per: Bollobas, B, et al.
Publicat: (2008) -
Metrics for sparse graphs
per: Bollobas, B, et al.
Publicat: (2007) -
The phase transition in inhomogeneous random graphs
per: Bollobas, B, et al.
Publicat: (2005) -
The cut metric, random graphs, and branching processes
per: Bollobas, B, et al.
Publicat: (2009) -
The phase transition in the uniformly grown random graph has infinite order
per: Bollobas, B, et al.
Publicat: (2005)