Multi-index algorithm of identifying important nodes in complex networks based on linear discriminant analysis

Abstract

The evaluation of node importance has great significance to complex network, so it is important to seek and protect important nodes to ensure the security and stability of the entire network. At present, most evaluation algorithms of node importance adopt the single-index methods, which are incomplete and limited, and cannot fully reflect the complex situation of network. In this paper, after synthesizing multi-index factors of node importance, including eigenvector centrality, betweenness centrality, closeness centrality, degree centrality, mutual-information, etc., the authors are proposing a new multi-index evaluation algorithm of identifying important nodes in complex networks based on linear discriminant analysis (LDA). In order to verify the validity of this algorithm, a series of simulation experiments have been done. Through comprehensive analysis, the simulation results show that the new algorithm is more rational, effective, integral and accurate.