Perturbation Analysis of Centrality Measures
Open Access
- 6 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 407-414
Abstract
In recent decades, a large number of centrality measures have been proposed to assess the importance of nodes in complex networks. The choice of the most appropriate centrality index for specific applications is one of the biggest challenges. This paper performs the perturbation analysis of 8 centrality measures. Since most real networks are incomplete and prone to bias, we compare centrality measures in order to evaluate their sensitivity to small changes in a graph structure. Our experiments are performed on 8 classical graph structures ranging from a simple path graph to a Watts-Strogatz graph model. As a result, we provide a sensitivity of centrality measures on different graph structures.Keywords
Funding Information
- Ministry of Science and Higher Education of the Russian Federation (??-3867.2022.1.6)
This publication has 18 references indexed in Scilit:
- Network Analysis of Bilateral Trade Data Under Asymmetry2020
- Influence of measurement errors on networks: Estimating the robustness of centrality measuresNetwork Science, 2019
- Missing Network Data A Comparison of Different Imputation Methods2018
- Axioms for CentralityInternet Mathematics, 2014
- Diffusion Centrality in Social Networks2012
- Robustness of centrality measures under uncertainty: Examining the role of network topologyComputational and Mathematical Organization Theory, 2009
- Effects of missing data in social networksSocial Networks, 2006
- On the robustness of centrality measures under conditions of imperfect dataSocial Networks, 2006
- Subgraph centrality in complex networksPhysical Review E, 2005
- The Centrality Index of a GraphPsychometrika, 1966