Article
Note on von Neumann and Rényi Entropies of a Graph
Linear Algebra and Its Applications
Document Type
Article
Disciplines
Publication Version
Accepted Manuscript
Publication Date
5-15-2017
DOI
10.1016/j.laa.2017.01.037
Abstract
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the star K1;n1 and prove this for almost all graphs of order n. We show that connected graphs of order n have Renyi 2-entropy at least as great as K1;n1 and for > 1, Kn maximizes Renyi -entropy over graphs of order n. We show that adding an edge to a graph can lower its von Neumann entropy.
Creative Commons License
Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International
Copyright Owner
Elsevier Inc.
Copyright Date
2017
Language
en
File Format
application/pdf
Citation Information
Michael Dairyko, Leslie Hogben, Jephian C.H. Lin, Joshua Lockhart, et al.. "Note on von Neumann and Rényi Entropies of a Graph" Linear Algebra and Its Applications Vol. 521 (2017) p. 240 - 253 Available at: http://works.bepress.com/leslie-hogben/39/
This is a manuscript of an article published as Dairyko, Michael, Leslie Hogben, Jephian C-H. Lin, Joshua Lockhart, David Roberson, Simone Severini, and Michael Young. "Note on von Neumann and Rényi entropies of a graph." Linear Algebra and its Applications 521 (2017): 240-253. DOI: 10.1016/j.laa.2017.01.037. Posted with permission.