Reseach Of Important Nodes Ranking And Evolutionary Model Of Complex Network

complex networks,it makes complex network research become a hot topic in many fields,including management,engineering,biomedical and so on.In fact,various networks are everywhere in both human society and nature,those networks always have small-world effect or Scale-Free effect.Many real networks can be denoted by network graphs which composed of many interacted nodes by using the theory of complex networks,then we can study the properties of this real network.Evaluating the importance of nodes in complex networks have became a important direction,we can control the stability of the networks by controlling the most important nodes of the networks.Different importance algorithm have different effect on preferential attachment mechanism.Many researchers studying the complex networks,because finding important nodes in complex networks has very crucial application value in real networks.It studies the nodes importance algorithm and evolutionary models based on the algorithm in this paper,and the main work is as following:1.We summarize the basic theory of the complex network and introduce some nodes importance algorithms,then analyze the some network evolutionary model.2.We propose clique degree theory by analyzing the drawback of degree nodes importance algorithms, then we propose WCD nodes importance algorithms base on weighted clique degree.WCD nodes importance algorithms consider the nodes degree and relations between the nodes,that is the each order clique degree of the nodes.And we improve the defect of single order clique degree,We propose the weighted clique degree and evaluating the importance of the nodes again.Experiment results indicate that WCD nodes importance algorithms not only can overcome the limitations of degree ranking,closeness ranking and betweenness ranking,but also can work out the limitation of treating all adjacency nodes equally in PageRank algorithm,thereby, they can find important nodes in complex networks more precisely and effectively.3.In allusion to the shortage of small-world model and BA model,we use WCD nodes importance algorithms to repalce the degree ranking in BA model,then we gives two models,the WCD model base on WCD nodes importance algorithms and improved WCD model base on li chen model.Experiment results indicate that the WCD model not only accord with power-law distribution,but also has better average shortest pathlength,clustering coefficient,and average degrees of network.The Improved WCD model is more in line with the real network.