Note on von Neumann and Rényi entropies of a graph
From MaRDI portal
Publication:513257
DOI10.1016/j.laa.2017.01.037zbMath1357.05075arXiv1609.00420OpenAlexW2964232779WikidataQ58005534 ScholiaQ58005534MaRDI QIDQ513257
Publication date: 3 March 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00420
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Measures of information, entropy (94A17) Connectivity (05C40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (6)
Symmetric Laplacians, quantum density matrices and their von-Neumann entropy ⋮ Approximations for von Neumann and Rényi entropies of graphs using the Euler-Maclaurin formula ⋮ On the von Neumann entropy of a graph ⋮ The von Neumann entropy of random multipartite graphs ⋮ Approximations for the von Neumann and Rényi entropies of graphs with circulant type Laplacians ⋮ Entropy of tournament digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Expected values of parameters associated with the minimum rank of a graph
- An upper bound on the sum of squares of degrees in a graph
- Maximum algebraic connectivity augmentation is NP-hard
- Information Theoretic Learning
This page was built for publication: Note on von Neumann and Rényi entropies of a graph
