A novel scale-free network model based on clique growth  

作　　者：王波 杨旭华 王万良 

机构地区：[1]College of Information Engineering,Zhejiang University of Technology

出　　处：《Journal of Central South University》2009年第3期474-477,共4页中南大学学报（英文版）

基　　金：Projects(60504027,60573123) supported by the National Natural Science Foundation of China;Project(20060401037) supported by the National Postdoctor Science Foundation of China;Project(X106866) supported by the Natural Science Foundation of Zhejiang Province,China

摘　　要：A novel scale-flee network model based on clique （complete subgraph of random size） growth and preferential attachment was proposed. The simulations of this model were carried out. And the necessity of two evolving mechanisms of the model was verified. According to the mean-field theory, the degree distribution of this model was analyzed and computed. The degree distribution function of vertices of the generating network P（d） is 2m^2m1^-3（d-m1 ＋ 1）^-3, where m and m1 denote the number of the new adding edges and the vertex number of the cliques respectively, d is the degree of the vertex, while one of cliques P（k） is 2m^2Ek^-3, where k is the degree of the clique. The simulated and analytical results show that both the degree distributions of vertices and cliques follow the scale-flee power-law distribution. The scale-free property of this model disappears in the absence of any one of the evolving mechanisms. Moreover, the randomicity of this model increases with the increment of the vertex number of the cliques.A novel scale-free network model based on clique (complete subgraph of random size) growth and preferential attachment was proposed. The simulations of this model were carried out. And the necessity of two evolving mechanisms of the model was verified. According to the mean-field theory, the degree distribution of this model was analyzed and computed. The degree distribution function of vertices of the generating network P(d) is 2 m 2 m1 -3 ( d-m1+ 1)-3, where m and m1 denote the number of the new adding edges and the vertex number of the cliques respectively, d is the degree of the vertex, while one of cliques P(k) is 2m2k-3, where k is the degree of the clique. The simulated and analytical results show that both the degree distributions of vertices and cliques follow the scale-free power-law distribution. The scale-free property of this model disappears in the absence of any one of the evolving mechanisms. Moreover, the randomicity of this model increases with the increment of the vertex number of the cliques.

关 键 词：SCALE-FREE clique growth preferential attachment degree distribution 

分 类 号：O481[理学—固体物理]