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

The von Neumann graph entropy (VNGE) can be used as a measure of graph complexity, which can be the measure of information divergence and distance between graphs. However, computing VNGE is extensively demanding for a large-scale graph. We propose novel quadratic approximations for fast computing VN...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Linear algebra and its applications 2020-01, Vol.585, p.127-146
Hauptverfasser:	Choi, Hayoung, He, Jinglian, Hu, Hang, Shi, Yuanming
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Complexity Computation Computer simulation Density matrix Divergence Entropy Graph dissimilarity Graphs Linear algebra Von Neumann entropy Von Neumann graph entropy
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!