The von Neumann Entropy of Networks

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.

[1]  J. Eisert,et al.  Multiparty entanglement in graph states , 2003, quant-ph/0307130.

[2]  Søren Riis.  Graph Entropy, Network Coding and Guessing games , 2007, ArXiv.

[3]  Mirjana Lazić,et al.  On the Laplacian energy of a graph , 2006 .

[4]  E. Andrade.  Contemporary Physics , 1945, Nature.

[5]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[6]  V. Vedral.  The role of relative entropy in quantum information theory , 2001, quant-ph/0102094.

[7]  Russell Merris,et al.  The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

[8]  R. Balakrishnan.  The energy of a graph , 2004 .

[9]  Danail Bonchev,et al.  Quantitative Measures of Network Complexity , 2005 .

[10]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[11]  A. Terras.  Fourier Analysis on Finite Groups and Applications: Index , 1999 .

[12]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[13]  S. Severini,et al.  The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States , 2004, quant-ph/0406165.

[14]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[15]  Victor Reiner,et al.  Shifted simplicial complexes are Laplacian integral , 2002 .

[16]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[17]  Ernesto Estrada,et al.  Characterization of the folding degree of proteins , 2002, Bioinform..

[18]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[19]  V. Sunder,et al.  The Laplacian spectrum of a graph , 1990 .

[20]  I. Gutman,et al.  Laplacian energy of a graph , 2006 .

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[23]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Simone Severini,et al.  Combinatorial laplacians and positivity under partial transpose , 2006, Mathematical Structures in Computer Science.

[25]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[26]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .