Degree correlations in graphs with clique clustering

Correlations among the degrees of vertices in random graphs often occur when clustering is present. In this paper we define a joint-degree correlation function for vertices in the giant component of clustered configuration model networks which are composed of clique subgraphs. We use this model to investigate, in detail, the organization among nearest-neighbor subgraphs for random graphs as a function of subgraph topology as well as clustering. We find an expression for the average joint degree of a neighbor in the giant component at the critical point for these networks. Finally, we introduce a novel edge-disjoint clique decomposition algorithm and investigate the correlations between the subgraphs of empirical networks.