In recent years, the increasing availability of data describing the dynamics of real-world systems led to a surge of interest in the complex networks of interactions that emerge from such systems. Several measures have been introduced to analyse these networks, and among them one of the most fundamental ones is vertex centrality, which quantifies the importance of a vertex within a graph. In this paper, we propose a novel vertex centrality measure based on the quantum information theoretical concept of Holevo quantity. More specifically, we measure the importance of a vertex in terms of the variation in graph entropy before and after its removal from the graph. More specifically, we find that the centrality of a vertex v can be broken down in two parts: (1) one which is negatively correlated with the degree centrality of v, and (2) one which depends on the emergence of non-trivial structures in the graph when v is disconnected from the rest of the graph. Finally, we evaluate our centrality measure on a number of real-world as well as synthetic networks, and we compare it against a set of commonly used alternative measures.
|Data di pubblicazione:||2017|
|Titolo:||Measuring vertex centrality using the Holevo quantity|
|Rivista:||LECTURE NOTES IN COMPUTER SCIENCE|
|Titolo del libro:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-319-58961-9_14|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|