The von Neumann Theil index: characterizing graph centralization using the von Neumann index
Authors:
Open Access
- 24 January 2018
- journal article
- research article
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 6 (6) , 859-876
Abstract
We show that the von Neumann entropy (from herein referred to as the von Neumann index) of a graph’s trace normalized combinatorial Laplacian provides structural information about the level of centralization across a graph. This is done by considering the Theil index, which is an established statistical measure used to determine levels of inequality across a system of ‘agents’, for example, income levels across a population. Here, we establish a Theil index for graphs, which provides us with a macroscopic measure of graph centralization. Concretely, we show that the von Neumann index can be used to bound the graph’s Theil index, and thus we provide a direct characterization of graph centralization via the von Neumann index. Because of the algebraic similarities between the bound and the Theil index, we call the bound the von Neumann Theil index. We elucidate our ideas by providing examples and a discussion of different |$n=7$| vertex graphs. We also discuss how the von Neumann Theil index provides a more comprehensive measure of centralization when compared to traditional centralization measures, and when compared to the graph’s classical Theil index. This is because it more accurately accounts for macro-structural changes that occur from micro-structural changes in the graph (e.g. the removal of a vertex). Finally, we provide future direction, showing that the von Neumann Theil index can be generalized by considering the Rényi entropy. We then show that this generalization can be used to bound the negative logarithm of the graph’s Jain fairness index.Keywords
All Related Versions
Funding Information
- EPSRC (EP/K04057X/2)
- UK National Quantum Technologies Programme (EP/M013243/1)
This publication has 20 references indexed in Scilit:
- Laplacian centrality: A new centrality measure for weighted networksInformation Sciences, 2012
- Shannon and von Neumann entropy of random networks with heterogeneous expected degreePhysical Review E, 2011
- A note on the von Neumann entropy of random graphsLinear Algebra and its Applications, 2010
- Entropy measures for networks: Toward an information theory of complex topologiesPhysical Review E, 2009
- The von Neumann Entropy of NetworksSSRN Electronic Journal, 2008
- The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed StatesAnnals of Combinatorics, 2006
- The Young Person's Guide to the Theil Index: Suggesting Intuitive Interpretations and Exploring Analytical ApplicationsSSRN Electronic Journal, 2000
- Equity Measures for Irrigation Performance EvaluationWater International, 1988
- Centrality in social networks conceptual clarificationSocial Networks, 1978
- Communication Patterns in Task-Oriented GroupsThe Journal of the Acoustical Society of America, 1950