Asymptotics for cliques in scale-free random graphs

Abstract

In this paper we establish asymptotics (as the size of the graph grows to infinity) for the expected number of cliques in the Chung--Lu inhomogeneous random graph model in which vertices are assigned independent weights which have tail probabilities $h^{1-α}l(h)$, where $α>2$ and $l$ is a slowly varying function. Each pair of vertices is connected by an edge with a probability proportional to the product of the weights of those vertices. We present a complete set of asymptotics for all clique sizes and for all non-integer $α> 2$. We also explain why the case of an integer $α$ is different, and present partial results for the asymptotics in that case.

Theorems & Definitions (22)

• Theorem 3.1
• Corollary 3.2
• Lemma 3.3
• Definition 3.4
• Corollary 3.5
• Lemma 3.6
• Lemma 3.7
• Lemma 3.8
• Lemma 3.9
• proof