• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2015, Vol. 37 ›› Issue (07): 1284-1289.

• 论文 • Previous Articles     Next Articles

A novel self-growing network model and its algorithm 

ZHANG Zhichang1,YAO Dongren1,LIU Xia2   

  1. (1.School of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070;
    2.School of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
  • Received:2014-11-18 Revised:2015-03-24 Online:2015-07-25 Published:2015-07-10

Abstract:

As is well known,most real world networks are not random networks.A few nodes usually have a lot of links while most nodes have few,and it is an important characteristic of scalefree networks,which is an important research topic.In this paper we firstly define a new type of selfgrowing network model, calculate its basic parameters,and validate its scalefree feature.We then prove that the degree distribution of the spanning tree with maximum leaves obeys the power law distribution and we get the balanced set of the network.Through those behaviors,we have a preliminary exploration on scalefree networks.Finally we propose an algorithm to calculate the average path length.

Key words: self-growing network;complex network;spanning trees;scale-free networks;balance set