Subgraph Counts in Random Clustering Graphs

We analyze subgraph counts in random clustering graphs for general degree distributions. Building on the prior work, we weaken the assumptions required to derive our previous results and exactly determine the asymptotics of subgraph counts in a random clustering graphs under mild conditions. As an application, we analyze the clustering coefficient and cycle counts in random clustering graphs.