Local clustering in scale-free networks with hidden variables

Abstract

We investigate the presence of triangles in a class of correlated random graphs in which hidden variables determine the pairwise connections between vertices. The class rules out self-loops and multiple edges and allows for negative degree correlations (disassortative mixing) due to infinite-variance degrees controlled by a structural cutoff $h_s$ and natural cutoff $h_c$. We show that local clustering decreases with the hidden variable (or degree). We also determine how the average clustering coefficient $C$ scales with the network size $N$, as a function of $h_s$ and $h_c$. For scale-free networks with exponent $2<\tau <3$ and the default choices $h_s\sim N^{1/2}$ and $h_c\sim N^{1/(\tau -1)}$ this gives $C\sim N^{2-\tau }\ln N$ for the universality class at hand. We characterize the extremely slow decay of $C$ when $\tau \approx 2$ and show that for $\tau =2.1$, say, clustering only starts to vanish for networks as large as $N=10^{11}$.

21 pages, 3 figures

References in corpus (18)

• Power-law distributions in empirical data
• The diameter of the world wide web
• The large-scale organization of metabolic networks
• Specificity and stability in topology of protein networks
• Scale-free topology of e-mail networks
• Generation of uncorrelated random scale-free networks
• Epidemic dynamics in finite size scale-free networks
• The statistical mechanics of networks
• The phase transition in inhomogeneous random graphs
• Class of correlated random networks with hidden variables
• Generating simple random graphs with prescribed degree distribution
• Analytical maximum-likelihood method to detect patterns in real networks
• Langevin approach for the dynamics of the contact process on annealed scale-free networks
• Clustering implies geometry in networks
• Novel scaling limits for critical inhomogeneous random graphs
• Critical window for the configuration model: finite third moment degrees
• Clustering of random scale-free networks
• Giant component sizes in scale-free networks with power-law degrees and cutoffs

Cited by in corpus (13)

• Counting cliques and cycles in scale-free inhomogeneous random graphs
• A generative graph model for electrical infrastructure networks
• Clustering Spectrum of scale-free networks
• Detecting hyperbolic geometry in networks: why triangles are not enough
• A general formulation of long-range degree correlations in complex networks
• Scale-free network clustering in hyperbolic and other random graphs
• Degree correlations in scale-free null models
• Generalised thresholding of hidden variable network models with scale-free property
• Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
• Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
• Sharpest possible clustering bounds using robust random graph analysis
• Inhomogeneous random graphs with infinite-mean fitness variables
• Robust subgraph counting with distribution-free random graph analysis