A novel scale-free network model based on clique growth

来源期刊：中南大学学报(英文版)2009年第3期

论文作者：王波 杨旭华 王万良

文章页码：474 - 477

Key words：scale-free; clique growth; preferential attachment; degree distribution

Abstract: 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 , where m and m₁ 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²k^-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.

基金信息：the National Natural Science Foundation of China
the National Postdoctor Science Foundation of China
the Natural Science Foundation of Zhejiang Province, China