There Is Recognition And Stability Of The Weighted Complex Network Of Key Nodes

In recent years, the complex network has become the hot topic of many scientists in a lot of field.In the basic researches of complex networks, assessing the importance of nodes, discovering the key nodes, has important theoretical and application value.At present,there are many methods to identify the key node both at home and abroad,but almost are for undirected and unweighted networks.however,in the real word, most of the complex network has both direction and weight value, so it need to find new evaluation index of the key nodes on directed weighted network model. In addition,the research of key node mainly focuses on identification and protection, and studies on the stability of key nodes lack sufficient attention, few scholars to study it. But in real life, the network topology is often changed by many factors affected,which will lead to a change in the key node ranking. How the network topology affect the ranking of key nodes, whether the stability of key nodes affected by disturbance in different network topologies have some differ, these issues are still unknown.In response to these problems, we made the following research aspects:Firstly,in this paper,we analied the principle of DWNodeRank key node identification method in directed weighted network,which is based on PageRank, put forward by hu man yu,and pointed out some problems when the algorithm is applied to large complex networks. In order to solve these problems, combined with community structure characteristics of complex networks, this paper improved the DWNodeRank algorithm, and put forword a new block DWNodeRank algorithm-B-DWNR algorithm.,And elaborated thealgorithm imple-mentation process by an instance.Secondly,this paper introducted the relevant theoretical for the the stability of the key nodes, on this basis, this paper proposes a new perturbation model-the "degree protection disturbances". Because for the key nodes throughout the network people usually only interested in ranking nodes, and the largest contribution to a key node is the indegree and instrength, therefore, this paper simulated a large-scale random disturbances by carried degree protection disturbances to every in-links of a node,which is ranked at10%of the front rank of the node. And derived a formula for determining the stability ranking of a key node in this disturbance.Finaly, paper has carried on the related simulation experiments and analysis of experimental results, verified the validity of the research content,proposed in this paper.