Clustering Spectrum of scale-free networks

DOI10.1103/PHYSREVE.96.042309MaRDI QIDQ6287542zbMATH OpenWikidataFDO

Authors Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden, A. J. E. M. Janssen

Publication date 6 June 2017

Full work available at URL https://doi.org/10.1103/PHYSREVE.96.042309

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 $$, the probability that two neighbors of a degree-$k$ node are neighbors themselves. We investigate how the clustering spectrum $$ 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 $$ remains flat, starts declining, and eventually settles on a power law $$ 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.

This page was built for publication: Clustering Spectrum of scale-free networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287542)