Sparse Random Graphs with Clustering
2011 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 38, no 3, 269-323 p.Article in journal (Refereed) Published
In 2007, we introduced a general model of sparse random graphs with (conditional) independence between the edges. The aim of this article 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 graph by adding not only edges but also other small graphs. In other words, we first construct an inhomogeneous random hypergraph with (conditionally) independent hyperedges, and then replace each hyperedge by a (perhaps complete) graph. Although flexible enough to produce graphs with significant dependence between edges, this model is nonetheless mathematically tractable. Indeed, we find the critical point where a giant component emerges in full generality, in terms of the norm of a certain integral operator, and relate the size of the giant component to the survival probability of a certain (non-Poisson) multi-type branching process. While our main focus is the phase transition, we also study the degree distribution and the numbers of small subgraphs. We illustrate the model with a simple special case that produces graphs with power-law degree sequences with a wide range of degree exponents and clustering coefficients.
Place, publisher, year, edition, pages
2011. Vol. 38, no 3, 269-323 p.
random graphs, clustering, phase transition
IdentifiersURN: urn:nbn:se:uu:diva-151643DOI: 10.1002/rsa.20322ISI: 000288859900003OAI: oai:DiVA.org:uu-151643DiVA: diva2:411057