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