Author
Listed:
- Bi, Yilin
- Jiao, Xinshan
- Zhou, Tao
Abstract
Numerous centrality measures have been proposed to evaluate the importance of nodes in networks, yet comparative analyses of these measures remain limited. Based on 80 real-world networks, we conducted an empirical analysis of 16 representative centrality measures. In general, node rankings produced by different measures show moderate to high correlations. We identified two distinct communities: one comprising 4 measures and the other comprising 7. Measures within the same community exhibit exceptionally strong pairwise correlations (all exceeding 0.7 as measured by Kendall’s τ). In contrast, the remaining five measures display markedly different behavior, showing weak correlations not only among themselves but also with the other measures. This suggests that each of these five measures likely captures unique properties of node importance. Using the Susceptible-Infected-Recovered (SIR) epidemic spreading model, we evaluated the performance of those considered measures. We found that LocalRank, Subgraph Centrality, and Katz Centrality perform best at identifying the most influential single node. In contrast, Leverage Centrality, Collective Influence, and Cycle Ratio excel at identifying influential node sets. Interestingly, despite using the same dynamical process, the rankings of the 16 centrality measures in identifying a single influential node versus an influential node set are negatively correlated. This reinforces our conviction that there is no one-size-fits-all centrality measure. We further showed that measures generating spatially clustered influential nodes tend to perform better in identifying a single influential node, while measures producing influential nodes with larger distances between them are likely to excel in an identifying influential node set.
Suggested Citation
Bi, Yilin & Jiao, Xinshan & Zhou, Tao, 2026.
"Performances and correlations of centrality measures in complex networks,"
Applied Mathematics and Computation, Elsevier, vol. 522(C).
Handle:
RePEc:eee:apmaco:v:522:y:2026:i:c:s009630032600024x
DOI: 10.1016/j.amc.2026.129972
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:522:y:2026:i:c:s009630032600024x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.