Next Article in Journal
A Novel Geometric Dictionary Construction Approach for Sparse Representation Based Image Fusion
Next Article in Special Issue
Complex Dynamics of an SIR Epidemic Model with Nonlinear Saturate Incidence and Recovery Rate
Previous Article in Journal
Quantum Probabilities and Maximum Entropy
Previous Article in Special Issue
Large Scale Emerging Properties from Non Hamiltonian Complex Systems
Article Menu
Issue 7 (July) cover image

Export Article

Open AccessArticle
Entropy 2017, 19(7), 303; doi:10.3390/e19070303

Node Importance Ranking of Complex Networks with Entropy Variation

Automation School, Beijing University of Posts and Telecommunications, Beijing 100876, China
Received: 28 May 2017 / Revised: 21 June 2017 / Accepted: 22 June 2017 / Published: 26 June 2017
(This article belongs to the Special Issue Complex Systems, Non-Equilibrium Dynamics and Self-Organisation)
View Full-Text   |   Download PDF [1444 KB, uploaded 26 June 2017]   |  


The heterogeneous nature of a complex network determines the roles of each node in the network that are quite different. Mechanisms of complex networks such as spreading dynamics, cascading reactions, and network synchronization are highly affected by a tiny fraction of so-called important nodes. Node importance ranking is thus of great theoretical and practical significance. Network entropy is usually utilized to characterize the amount of information encoded in the network structure and to measure the structural complexity at the graph level. We find that entropy can also serve as a local level metric to quantify node importance. We propose an entropic metric, Entropy Variation, defining the node importance as the variation of network entropy before and after its removal, according to the assumption that the removal of a more important node is likely to cause more structural variation. Like other state-of-the-art methods for ranking node importance, the proposed entropic metric is also used to utilize structural information, but at the systematical level, not the local level. Empirical investigations on real life networks, the Snake Idioms Network, and several other well-known networks, demonstrate the superiority of the proposed entropic metric, notably outperforming other centrality metrics in identifying the top-k most important nodes. View Full-Text
Keywords: complex networks; node importance; centrality; entropy variation complex networks; node importance; centrality; entropy variation

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

Ai, X. Node Importance Ranking of Complex Networks with Entropy Variation. Entropy 2017, 19, 303.

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