The key nodes in complex networks are of great significance for understanding and controlling complex networks. This paper proposes a local centrality node recognition algorithm. This method comprehensively evaluates the characteristics of the node itself, the characteristics of the second order neighbor node and the Ks value of the node. Experimental results show that this method does not rely on other parameters, and can effectively improve the resolution of node recognition.

No abstract