# Discriminating Power of Centrality Measures

arXiv: https://arxiv.org/abs/1305.3146 · HTML: https://mlsanity.com/paper/1305.3146/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 May 2013.

## Built on by (most cited first, 1 of 1)

- [Graphtester: Exploring Theoretical Boundaries of GNNs on Graph Datasets](https://mlsanity.com/paper/2306.17482/) (2023)

## Abstract (arXiv)

The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of individual vertices, edges, or other components. Different centralities attempt to measure importance in different ways. In this paper, we examine a conjecture posed by E. Estrada regarding the ability of several measures to distinguish the vertices of networks. Estrada conjectured that if all vertices of a graph have the same subgraph centrality, then all vertices must also have the same degree, eigenvector, closeness, and betweenness centralities. We provide a counterexample for the latter two centrality measures and propose a revised conjecture.