Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations

DOI10.1016/j.laa.2019.09.031zbMath1426.05024arXiv1811.11087OpenAlexW2978362301WikidataQ127216168 ScholiaQ127216168MaRDI QIDQ2332459

Hayoung Choi, Hang Hu, Yuanming Shi, Jinglian He

Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.11087

zbMATH Keywords

density matrixvon Neumann entropygraph dissimilarityvon Neumann graph entropy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Quantum computation (81P68) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximate quadratures (41A55) Distance in graphs (05C12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Estimating the trace of matrix functions with application to complex networks ⋮ Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods

Cites Work

• Unnamed Item
• Unnamed Item
• Distance between spectra of graphs
• A new dissimilarity measure for comparing labeled graphs
• Distance between the normalized Laplacian spectra of two graphs
• Comparing large-scale graphs based on quantum probability theory
• Statistical mechanics of complex networks
• Quantum Information
• A new metric for probability distributions
• Data-Adaptive Active Sampling for Efficient Graph-Cognizant Classification
• Quantum Theory for Mathematicians
• Collective dynamics of ‘small-world’ networks
• Random Graphs

This page was built for publication: Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations