Local computation method of node importance in complicated network based on improved structural hole

The invention relates to a local computation method of node importance in a complicated network based on an improved structural hole. The method comprises the steps that importance degrees of adjacent nodes for nodes are weighed by defining adjacency degrees and secondary adjacency degrees of the nodes; and the node in a key position in the network is found by computing a ratio of the investment time (energy) of the adjacent node to the total time (energy) of the node, and measuring a constraint index of the structural hole in the network, wherein the smaller the constraint index is, the closer the node is to the key position. An experimental result indicates that the method has better advantages in evaluating the node importance in an ARPA (Address and Routing Parameter Area) network than betweenness, degree and proximity indexes. According to the method, all computation is obtained on the basis of the adjacent nodes and the secondary adjacent nodes of the nodes, so that particularly, the key node in a global unknown network can be found well, and some application limitations in the global aspect are overcome.