"Clumpiness" Mixing in Complex Networks
arXiv:0905.4096 · doi:10.1088/1742-5468/2008/03/P03008
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 characteristic, 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 a 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 network. Numerical calculations demonstrate that the classification scheme successfully categorizes 30 real-world networks into the four classes: clumped assortative, clumped disassortative, loose assortative and loose disassortative networks. The clumpiness coefficient also differentiates the Erdos-Renyi model from the Barabasi-Albert model, which the assortativity coefficient could not differentiate. In addition, the bounds of the clumpiness coefficient as well as the relationships between the three measures of clumpiness are discussed.
47 pages, 11 figures
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Assortative mixing in networks
- Characterization of complex networks: A survey of measurements
- Subgraph Centrality in Complex Networks
- Communicability in complex networks
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Loop quantum gravity: an outside view
- Loop series for discrete statistical models on graphs
- Spectral Scaling in Complex Networks
- A network-based ranking system for American college football
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Dynamics of Social Diversity