The von Neumann entropy of networks
arXiv:0812.2597 · doi:10.4018/978-1-60960-171-3.ch005
Abstract
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study its von Neumann entropy. At the graph-theoretic level, this quantity may be interpreted as a measure of regularity; it tends to be larger in relation to the number of connected components, long paths and nontrivial symmetries. When the set of vertices is asymptotically large, we prove that regular graphs and the complete graph have equal entropy, and specifically it turns out to be maximum. On the other hand, when the number of edges is fixed, graphs with large cliques appear to minimize the entropy.
6 pages, 3 figures
References in corpus (6)
- Subgraph Centrality in Complex Networks
- The Role of Relative Entropy in Quantum Information Theory
- Multi-party entanglement in graph states
- Adaptive Coevolutionary Networks: A Review
- The entropy of network ensembles
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states