M-Centrality: identifying key nodes based on global position and local degree variation

TL;DR

M-Centrality is a new multi-attribute measure that combines global position and local degree variation to identify influential nodes efficiently in large networks.

Contribution

It introduces M-Centrality, a novel measure combining K-shell and local degree variation, outperforming existing metrics in influence and connectivity tasks.

Findings

Outperforms existing centrality measures in identifying influential spreaders.

Effective in maintaining network connectivity.

Low computational complexity suitable for large networks.

Abstract

Identifying influential nodes in a network is a major issue due to the great deal of applications concerned, such as disease spreading and rumor dynamics. That is why, a plethora of centrality measures has emerged over the years in order to rank nodes according to their topological importance in the network. Local metrics such as degree centrality make use of a very limited information and are easy to compute. Global metrics such as betweenness centrality exploit the information of the whole network structure at the cost of a very high computational complexity. Recent works have shown that combining multiple metrics is a promising strategy to quantify the node's influential ability. Our work is in this line. In this paper, we introduce a multi-attributes centrality measure called M-Centrality that combines the information on the position of the node in the network with the local information on its nearest neighborhood. The position is measured by the K-shell decomposition, and the degree variation in the neighborhood of the node quantifies the influence of the local context. In order to examine the performances of the proposed measure, we conduct experiments on small and large scale real-world networks from the perspectives of transmission dynamics and network connectivity. According to the empirical results, the M-Centrality outperforms its alternatives in identifying both influential spreaders and nodes essential to maintain the network connectivity. In addition, its low computational complexity makes it easily applied to large scale networks.