J Shanghai Jiaotong Univ Sci ›› 2022, Vol. 27 ›› Issue (5): 688-698.doi: 10.1007/s12204-021-2373-6

• • 上一篇    下一篇

  

  • 收稿日期:2020-07-07 出版日期:2022-09-28 发布日期:2022-09-03

A Novel Method Based on Node's Correlation to Evaluate Important Nodes in Complex Networks

LU Pengli1∗ (卢鹏丽), DONG Chen1,2 (董晨), GUO Yuhong3 (郭育红)   

  1. (1. School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China; 2. School of Management, Shanghai University, Shanghai 200444, China; 3. School of Mathematics and Statistics, Hexi University, Zhangye 734000, Gansu, China)
  • Received:2020-07-07 Online:2022-09-28 Published:2022-09-03

Abstract: Finding the important nodes in complex networks by topological structure is of great significance to network invulnerability. Several centrality measures have been proposed recently to evaluate the performance of nodes based on their correlation, showing that the interaction between nodes has an influence on the importance of nodes. In this paper, a novel method based on node’s distribution and global influence in complex networks is proposed. The nodes in the complex networks are classified according to the distance matrix; then the correlation coefficient between pairs of nodes is calculated. From the whole perspective in the network, the global similarity centrality (GSC) is proposed based on the relevance and the shortest distance between any two nodes. The efficiency, accuracy, and monotonicity of the proposed method are analyzed in two artificial datasets and eight real datasets of different sizes. Experimental results show that the performance of GSC method outperforms those current state-of-the-art algorithms.

Key words: node importance, network topology, global similarity centrality (GSC), distribution vector, susceptible-infected-recovered (SIR) model

中图分类号: