The impact of partially missing communities on the reliability of centrality measures

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Network data is usually not error-free, and the absence of some nodes is a very common type of measurement error. Studies have shown that the reliability of centrality measures is severely affected by missing nodes. This paper investigates the reliability of centrality measures when missing nodes are likely to belong to the same community. We study the behavior of five commonly used centrality measures in uniform and scale-free networks in various error scenarios. We find that centrality measures are generally more reliable when missing nodes are likely to belong to the same community than in cases in which nodes are missing uniformly at random. In scale-free networks, the betweenness centrality becomes, however, less reliable when missing nodes are more likely to belong to the same community. Moreover, centrality measures in scale-free networks are more reliable in networks with stronger community structure. In contrast, we do not observe this effect for uniform networks. Our observations suggest that the impact of missing nodes on the reliability of centrality measures might not be as severe as the literature suggests.

Cite

CITATION STYLE

APA

Martin, C. (2018). The impact of partially missing communities on the reliability of centrality measures. In Studies in Computational Intelligence (Vol. 689, pp. 41–52). Springer Verlag. https://doi.org/10.1007/978-3-319-72150-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free