The von Neumann entropy of networks

Filippo Passerini and Simone Severini

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Networks (search for similar items in EconPapers)
JEL-codes: C02 (search for similar items in EconPapers)
Date: 2008-12-14
New Economics Papers: this item is included in nep-net
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/12538/1/MPRA_paper_12538.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:12538

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().