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...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Bollobas, B, Janson, S, Riordan, O
Materialtyp: Journal article
Språk:English
Publicerad: 2008