A note on the von Neumann entropy of random graphs.
LINEAR ALGEBRA APPL
1722 - 1725.
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. (C) 2010 Elsevier Inc. All rights reserved.
|Title:||A note on the von Neumann entropy of random graphs|
|Keywords:||Graph spectra, von Neumann entropy, Laplacian|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only