A Topology Overlap-based Algorithm for Identifying Key Nodes in Complex Networks

Abstract

Key node identification is an important tool for analyzing and mastering complex networks, and plays an important role in studying the destructiveness, robustness, and vulnerability of networks and maintaining the stability of networks. In order to identify the critical nodes in complex networks efficiently and accurately, this paper proposes a node importance identification method based on network topology overlap, which makes up for the deficiency of a single criterion of degree centrality in the process of critical node identification by calculating the number of intersections of degree centrality and neighboring nodes. The results show that the algorithm can identify the critical nodes in the actual communication network more accurately and suggest the optimization of anti-destructiveness under deliberate attacks, which effectively improves the stability of the fiber optic communication network through simulation tests and destructiveness analysis in some regions.