Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Clustering Spectrum of scale-free networks (1706.01727v2)

Published 6 Jun 2017 in cs.SI, math.PR, and physics.soc-ph

Abstract: Real-world networks often have power-law degrees and scale-free properties such as ultra-small distances and ultra-fast information spreading. In this paper, we study a third universal property: three-point correlations that suppress the creation of triangles and signal the presence of hierarchy. We quantify this property in terms of $\bar c(k)$, the probability that two neighbors of a degree-$k$ node are neighbors themselves. We investigate how the clustering spectrum $k\mapsto\bar c(k)$ scales with $k$ in the hidden variable model and show that $c(k)$ follows a {\it universal curve} that consists of three $k$-ranges where $\bar c(k)$ remains flat, starts declining, and eventually settles on a power law $\bar c(k)\sim k{-\alpha}$ with $\alpha$ depending on the power law of the degree distribution. We test these results against ten contemporary real-world networks and explain analytically why the universal curve properties only reveal themselves in large networks.

Citations (20)

Summary

We haven't generated a summary for this paper yet.