Sparse random graphs with clustering

Abstract

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 graph by adding not only edges but also other small graphs. In other words, we first construct an inhomogeneous random hypergraph with 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.

62 pages; minor revision

References in corpus (3)

• The phase transition in inhomogeneous random graphs
• Percolation on dense graph sequences
• Spread-out percolation in R^d

Cited by in corpus (11)

• Networks beyond pairwise interactions: structure and dynamics
• Spatial preferential attachment networks: Power laws and clustering coefficients
• Epidemics on random intersection graphs
• Endemic infections are always possible on regular networks
• Phase Transition of Random Non-Uniform Hypergraphs
• The cut metric, random graphs, and branching processes
• Subgraph covers -- An information theoretic approach to motif analysis in networks
• A dynamic network in a dynamic population: asymptotic properties
• Atomic subgraphs and the statistical mechanics of networks
• Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles
• Differential calculus on the space of countable labelled graphs