Entropy versus heterogeneity for graphs

DOI10.1007/978-3-642-20844-7_4MaRDI QIDQ3003442zbMATH OpenOpenAlexWikidataFDO

Authors Lin Han, Edwin R. Hancock, Richard C. Wilson

Publication date 27 May 2011

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20844-7_4

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90)

Recommendations

• On the von Neumann entropy of graphs
• Exploring the heterogeneity for node importance byvon Neumann entropy
• A history of graph entropy measures
• On the von Neumann entropy of a graph
• Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations

Cited in

(10)

• Approximations for von Neumann and Rényi entropies of graphs using the Euler-Maclaurin formula
• Exploring the heterogeneity for node importance byvon Neumann entropy
• Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
• Approximations for the von Neumann and Rényi entropies of graphs with circulant type Laplacians
• Graphs that Split Entropies
• The von Neumann Theil index: characterizing graph centralization using the von Neumann index
• Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
• On the von Neumann entropy of graphs
• Heterogeneity of social network based on degree sequence and community
• On the Rényi index of random graphs

This page was built for publication: Entropy versus heterogeneity for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003442)