Degree correlations in graphs with clique clustering
arXiv:2607.15519 · doi:10.1103/PhysRevE.105.044314
Abstract
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.
17 pages, 9 figures
References in corpus (25)
- Finding community structure in networks using the eigenvectors of matrices
- Self-similarity of complex networks
- Random graphs with clustering
- Random graphs containing arbitrary distributions of subgraphs
- Tuning clustering in random networks with arbitrary degree distributions
- The unreasonable effectiveness of tree-based theory for networks with clustering
- Motif-based communities in complex networks
- How clustering affects the bond percolation threshold in complex networks
- Cascades on a class of clustered random networks
- Bond percolation on a class of clustered random networks
- Component sizes in networks with arbitrary degree distributions
- Network clique cover approximation to analyze complex contagions through group interactions
- Correlations in connected random graphs
- Disassortativity of percolating clusters in random networks
- General and exact approach to percolation on random graphs
- Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
- Random graphs with arbitrary clustering and their applications
- A general formulation of long-range degree correlations in complex networks
- Percolation in random graphs with higher-order clustering
- Structure of percolating clusters in random clustered networks
- Spectra of random networks in the weak clustering regime
- An exact formula for percolation on higher-order cycles
- Emergence of Long-Range Correlations in Random Networks
- Generating random networks that consist of a single connected component with a given degree distribution
- Observability transitions in clustered networks