On the Similarity between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications

by   Xuecheng Liu, et al.

The von Neumann graph entropy is a measure of graph complexity based on the Laplacian spectrum. It has recently found applications in various learning tasks driven by networked data. However, it is computational demanding and hard to interpret using simple structural patterns. Due to the close relation between Lapalcian spectrum and degree sequence, we conjecture that the structural information, defined as the Shannon entropy of the normalized degree sequence, might be a good approximation of the von Neumann graph entropy that is both scalable and interpretable. In this work, we thereby study the difference between the structural information and von Neumann graph entropy named as entropy gap. Based on the knowledge that the degree sequence is majorized by the Laplacian spectrum, we for the first time prove the entropy gap is between 0 and log_2 e in any undirected unweighted graphs. Consequently we certify that the structural information is a good approximation of the von Neumann graph entropy that achieves provable accuracy, scalability, and interpretability simultaneously. This approximation is further applied to two entropy-related tasks: network design and graph similarity measure, where novel graph similarity measure and fast algorithms are proposed. Our experimental results on graphs of various scales and types show that the very small entropy gap readily applies to a wide range of graphs and weighted graphs. As an approximation of the von Neumann graph entropy, the structural information is the only one that achieves both high efficiency and high accuracy among the prominent methods. It is at least two orders of magnitude faster than SLaQ with comparable accuracy. Our structural information based methods also exhibit superior performance in two entropy-related tasks.


Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications

The von Neumann graph entropy (VNGE) facilitates the measure of informat...

Fast Computing von Neumann Entropy for Large-scale Graphs via Quadratic Approximations

The von Neumann graph entropy (VNGE) can be used as a measure of graph c...

Graphs with minimum degree-based entropy

The degree-based entropy of a graph is defined as the Shannon entropy ba...

Dynamic Measurement of Structural Entropy for Dynamic Graphs

Structural entropy solves the problem of measuring the amount of informa...

Structure Entropy and Resistor Graphs

We propose the notion of resistance of a graph as an accompanying notio...

A Functional Information Perspective on Model Interpretation

Contemporary predictive models are hard to interpret as their deep nets ...

Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs

Graph comparison is a fundamental operation in data mining and informati...

Please sign up or login with your details

Forgot password? Click here to reset