Finding Key Nodes in Complex Networks: An Edge and Local Partition Approach

With the developments of complex systems, the scale of complex networks is gradually increasing. Finding the key nodes is an important prerequisite for network utilization and protection in the network. To more accurately evaluate the importance of nodes in the network, this paper proposes an edge-based and local partition method to identify the key nodes. This method considers not only the network connectivity of the partitioned edges but also the substitutability of the edges. Then calculate the importance sequence of the nodes through a conversion relationship. In a variety of complex network environments, compared with existing methods, the results show that the method is better than existing methods in evaluating the importance of different network nodes. When removing the same number of nodes, the proposed method is more destructive to the network than other methods.