The von Neumann entropy of random multipartite graphs

Dan Hu; Xueliang Li; Xiaogang Liu; Shenggui Zhang

doi:10.1016/j.dam.2017.07.008

The von Neumann entropy of random multipartite graphs

Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Let G be a graph with n vertices and L(G) its Laplacian matrix. Define ρ_G=[formula presented]L(G) to be the density matrix of G, where d_G denotes the sum of degrees of all vertices of G. Let λ₁,λ₂,…,λ_n be the eigenvalues of ρ_G. The von Neumann entropy of G is defined as S(G)=−∑_i=1ⁿλ_ilog₂λ_i. In this paper, we establish a lower bound and an upper bound to the von Neumann entropy for random multipartite graphs.

Original language	English
Pages (from-to)	201-206
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	232
DOIs	https://doi.org/10.1016/j.dam.2017.07.008
State	Published - 11 Dec 2017

Keywords

Density matrix
Random multipartite graphs
von Neumann entropy

Access to Document

10.1016/j.dam.2017.07.008

Cite this

@article{7390127bddf449f6b67ff5eb3abda490,

title = "The von Neumann entropy of random multipartite graphs",

abstract = "Let G be a graph with n vertices and L(G) its Laplacian matrix. Define ρG=[formula presented]L(G) to be the density matrix of G, where dG denotes the sum of degrees of all vertices of G. Let λ1,λ2,…,λn be the eigenvalues of ρG. The von Neumann entropy of G is defined as S(G)=−∑i=1nλilog2λi. In this paper, we establish a lower bound and an upper bound to the von Neumann entropy for random multipartite graphs.",

keywords = "Density matrix, Random multipartite graphs, von Neumann entropy",

author = "Dan Hu and Xueliang Li and Xiaogang Liu and Shenggui Zhang",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = dec,

day = "11",

doi = "10.1016/j.dam.2017.07.008",

language = "英语",

volume = "232",

pages = "201--206",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - The von Neumann entropy of random multipartite graphs

AU - Hu, Dan

AU - Li, Xueliang

AU - Liu, Xiaogang

AU - Zhang, Shenggui

PY - 2017/12/11

Y1 - 2017/12/11

N2 - Let G be a graph with n vertices and L(G) its Laplacian matrix. Define ρG=[formula presented]L(G) to be the density matrix of G, where dG denotes the sum of degrees of all vertices of G. Let λ1,λ2,…,λn be the eigenvalues of ρG. The von Neumann entropy of G is defined as S(G)=−∑i=1nλilog2λi. In this paper, we establish a lower bound and an upper bound to the von Neumann entropy for random multipartite graphs.

AB - Let G be a graph with n vertices and L(G) its Laplacian matrix. Define ρG=[formula presented]L(G) to be the density matrix of G, where dG denotes the sum of degrees of all vertices of G. Let λ1,λ2,…,λn be the eigenvalues of ρG. The von Neumann entropy of G is defined as S(G)=−∑i=1nλilog2λi. In this paper, we establish a lower bound and an upper bound to the von Neumann entropy for random multipartite graphs.

KW - Density matrix

KW - Random multipartite graphs

KW - von Neumann entropy

UR - http://www.scopus.com/inward/record.url?scp=85027583211&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2017.07.008

DO - 10.1016/j.dam.2017.07.008

M3 - 文章

AN - SCOPUS:85027583211

SN - 0166-218X

VL - 232

SP - 201

EP - 206

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

The von Neumann entropy of random multipartite graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this