Comprehensive Evaluation of Node Importance in Complex Networks

Identifying important nodes quickly and effectively in complex networks is one of the effective ways to control the propagation process of networks. Node importance ranking is the main method to identify important nodes. In this paper, the SIR model is used to simulate the network propagation process based on seven node importance sorting algorithms. The performance of the algorithm is evaluated from aspects of resolution and accuracy. In the experiment, seven algorithms are compared and analyzed in three theoretical networks and seven real networks using the above two evaluation criteria. The network characteristics suitable for different algorithms are obtained, which has great reference value for the application of important node sorting algorithm in complex networks.