Normal and stable approximation to subgraph counts in superpositions of Bernoulli random graphs

• Published in: Journal of applied probability Vol. 61; no. 2; pp. 401 - 419
• Main Authors: Bloznelis, Mindaugas, Karjalainen, Joona, Leskelä, Lasse
• Format: Journal Article
• Language: English
• Published: Cambridge, UK Cambridge University Press 01.06.2024
• Subjects: Approximation; Clustering; Graph theory; Graphs; Nodes; Original Article; Parameter estimation; Probability; Statistical analysis; random intersection graph; 05C82; normal approximation; complex network; overlapping communities; 05C80; affiliation network; power law; 91C20; Erdös–Rényi graph; clustering; Subgraph count; 60F05
• ISSN: 0021-9002; 1475-6072
• DOI: 10.1017/jpr.2023.48

Real networks often exhibit clustering, the tendency to form relatively small groups of nodes with high edge densities. This clustering property can cause large numbers of small and dense subgraphs to emerge in otherwise sparse networks. Subgraph counts are an important and commonly used source of information about the network structure and function. We study probability distributions of subgraph counts in a community affiliation graph. This is a random graph generated as an overlay of m partly overlapping independent Bernoulli random graphs (layers) $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint distribution of layer sizes and densities. When m grows linearly in the number of nodes n, the model generates sparse random graphs with a rich statistical structure, admitting a nonvanishing clustering coefficient and a power-law limiting degree distribution. In this paper we establish the normal and $\alpha$ -stable approximations to the numbers of small cliques, cycles, and more general 2-connected subgraphs of a community affiliation graph.