2000 character limit reached
Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations (1811.11087v2)
Published 12 Nov 2018 in cs.IT, cs.DS, cs.SI, eess.SP, math.IT, and physics.data-an
Abstract: 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 VNGE. Various inequalities for error between the quadratic approximations and the exact VNGE are found. Our methods reduce the cubic complexity of VNGE to linear complexity. Computational simulations on random graph models and various real network datasets demonstrate superior performance.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.