Next Article in Journal
On a Robust MaxEnt Process Regression Model with Sample-Selection
Previous Article in Journal
Shannon Entropy of Binary Wavelet Packet Subbands and Its Application in Bearing Fault Extraction
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle

A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks

1, 1,2,*, 1 and 3
School of Economics and Management, Beihang University, Beijing 100191, China
Key Laboratory of Complex System Analysis and Management Decision, Ministry of Education, Beijing 100191, China
Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
Author to whom correspondence should be addressed.
Entropy 2018, 20(4), 261;
Received: 20 March 2018 / Revised: 30 March 2018 / Accepted: 7 April 2018 / Published: 9 April 2018
PDF [4232 KB, uploaded 3 May 2018]


Measuring centrality has recently attracted increasing attention, with algorithms ranging from those that simply calculate the number of immediate neighbors and the shortest paths to those that are complicated iterative refinement processes and objective dynamical approaches. Indeed, vital nodes identification allows us to understand the roles that different nodes play in the structure of a network. However, quantifying centrality in complex networks with various topological structures is not an easy task. In this paper, we introduce a novel definition of entropy-based centrality, which can be applicable to weighted directed networks. By design, the total power of a node is divided into two parts, including its local power and its indirect power. The local power can be obtained by integrating the structural entropy, which reveals the communication activity and popularity of each node, and the interaction frequency entropy, which indicates its accessibility. In addition, the process of influence propagation can be captured by the two-hop subnetworks, resulting in the indirect power. In order to evaluate the performance of the entropy-based centrality, we use four weighted real-world networks with various instance sizes, degree distributions, and densities. Correspondingly, these networks are adolescent health, Bible, United States (US) airports, and Hep-th, respectively. Extensive analytical results demonstrate that the entropy-based centrality outperforms degree centrality, betweenness centrality, closeness centrality, and the Eigenvector centrality. View Full-Text
Keywords: complex network; vital nodes; weighted networks; centrality; entropy-based centrality complex network; vital nodes; weighted networks; centrality; entropy-based centrality

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Qiao, T.; Shan, W.; Yu, G.; Liu, C. A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks. Entropy 2018, 20, 261.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top