arXiv Analytics

Sign in

arXiv:cond-mat/0408063AbstractReferencesReviewsResources

Pair Correlations in Scale-Free Networks

Huang Zhuang-Xiong, Wang Xin-Ran, Zhu Han

Published 2004-08-03Version 1

Correlation between nodes is found to be a common and important property in many complex networks. Here we investigate degree correlations of the Barabasi-Albert (BA) Scale-Free model with both analytical results and simulations, and find two neighboring regions, a disassortative one for low degrees and a neutral one for high degrees. The average degree of the neighbors of a randomly picked node is expected to diverge in the limit of infinite network size. As an generalization of the concept of correlation, we also study the correlations of other scalar properties, including age and clustering coefficient. Finally we propose a correlation measurement in bipartite networks.

Related articles: Most relevant | Search more
arXiv:cond-mat/0301124 (Published 2003-01-09)
Search and Congestion in Complex Networks
arXiv:1206.2898 [cond-mat.stat-mech] (Published 2012-06-13, updated 2012-11-20)
Long-Range Navigation on Complex Networks using Lévy Random Walks
arXiv:cond-mat/0312236 (Published 2003-12-09)
Preferential Exchange: Strengthening Connections in Complex Networks