arXiv Analytics

Sign in

arXiv:cond-mat/0502253AbstractReferencesReviewsResources

A general model for collaboration networks

Tao Zhou, Ying-di Jin, Bing-Hong Wang, Da-Ren He, Pei-Pei Zhang, Yue He, Bei-Bei Su, Kan Chen, Zhong-Zhi Zhang

Published 2005-02-10, updated 2005-05-13Version 2

In this paper, we propose a general model for collaboration networks. Depending on a single free parameter "{\bf preferential exponent}", this model interpolates between networks with a scale-free and an exponential degree distribution. The degree distribution in the present networks can be roughly classified into four patterns, all of which are observed in empirical data. And this model exhibits small-world effect, which means the corresponding networks are of very short average distance and highly large clustering coefficient. More interesting, we find a peak distribution of act-size from empirical data which has not been emphasized before of some collaboration networks. Our model can produce the peak act-size distribution naturally that agrees with the empirical data well.

Related articles: Most relevant | Search more
arXiv:cond-mat/0512229 (Published 2005-12-11)
General model for Apollonian networks
arXiv:cond-mat/0104214 (Published 2001-04-12)
Extremal Optimization for Graph Partitioning
arXiv:cond-mat/0404710 (Published 2004-04-29)
An empirical test for cellular automaton models of traffic flow