Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

'Clumpiness' mixing in complex networks

Estrada, E. and Hatano, N. and Gutierrez, A. and , “Ramón y Cajal”, Spain (Funder) (2008) 'Clumpiness' mixing in complex networks. Journal of Statistical Mechanics: Theory and Experiment, 2008. pp. 1-25. ISSN 1742-5468

[img]
Preview
PDF (Clumpiness-JSMTE-Revised.pdf)
Clumpiness-JSMTE-Revised.pdf

Download (608kB) | Preview

Abstract

Three measures of clumpiness of complex networks are introduced. The measures quantify how most central nodes of a network are clumped together. The assortativity coefficient defined in a previous study measures a similar characteristics but accounts only for the clumpiness of the central nodes that are directly connected to each other. The clumpiness coefficient defined in the present paper also takes into account the cases where central nodes are separated by few links. The definition is based on the node degrees and the distances between pairs of nodes. The clumpiness coefficient together with the assortativity coefficient can define four classes of networks. Numerical calculations demonstrate that the classification scheme successfully categorize 30 real-world networks into the four classes of clumped assortative, clumped disassortative, loose assortative and loose disassortative networks. The clumpiness coefficient also differentiates the Erdös-Rényi model from the Barabási-Albert model, which the assortativity coefficient could not differentiate. In addition, the bounds of the clumpiness coefficient as well as the relations among the three measures of clumpiness are discussed.