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

Mindaugas Bloznelis, Joona Karjalainen, Lasse Leskelä

Published 2021-07-06Version 1

The clustering property of a complex network signals about the abundance of small dense subgraphs in otherwise sparse network. We establish the normal and stable approximation to the number of small cliques, cycles and more general $2$-connected subgraphs in the network model defined by a superposition of Bernoulli random graphs that admits non-vanishing global clustering coefficient and power law degrees.