论文信息 - A note on the von Neumann entropy of random graphs

A note on the von Neumann entropy of random graphs

Abstract In this note, we consider the von Neumann entropy of a density matrix obtained by normalizing the combinatorial Laplacian of a graph by its degree sum. We prove that the von Neumann entropy of the typical Erdos–Renyi random graph saturates its upper bound. Since connected regular graphs saturate this bound as well, our result highlights a connection between randomness and regularity. A general interpretation of the von Neumann entropy of a graph is an open problem.

[1] Ginestra Bianconi,et al. Toward an information theory of complex networks , 2009 .

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

[3] H. Weyl. Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung) , 1912 .

[4] Ginestra Bianconi,et al. Entropy measures for networks: toward an information theory of complex topologies. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5] Carlo Rovelli,et al. Single particle in quantum gravity and Braunstein-Ghosh-Severini entropy of a spin network , 2009, 0905.2983.

[6] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

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

[8] 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.

[9] A. Dembo,et al. Spectral measure of large random Hankel, Markov and Toeplitz matrices , 2003, math/0307330.

[10] Simone Severini,et al. The von Neumann Entropy of Networks , 2008 .

[11] D. Petz,et al. Quantum Entropy and Its Use , 1993 .