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...
المؤلفون الرئيسيون: | Bollobas, B, Janson, S, Riordan, O |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
2008
|
مواد مشابهة
-
Sparse graphs: metrics and random models
حسب: Bollobas, B, وآخرون
منشور في: (2008) -
Metrics for sparse graphs
حسب: Bollobas, B, وآخرون
منشور في: (2007) -
The phase transition in inhomogeneous random graphs
حسب: Bollobas, B, وآخرون
منشور في: (2005) -
The cut metric, random graphs, and branching processes
حسب: Bollobas, B, وآخرون
منشور في: (2009) -
The phase transition in the uniformly grown random graph has infinite order
حسب: Bollobas, B, وآخرون
منشور في: (2005)