Inequalities for entropy-based measures of network information content

DOI10.1016/j.amc.2009.12.051zbMath1220.05125MaRDI QIDQ961624

Abbe Mowshowitz, Matthias Dehmer

Publication date: 31 March 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.12.051

zbMATH Keywords

entropy; inequalities; graphs; information theory; structural information content

Mathematics Subject Classification ID

05C90: Applications of graph theory

90B10: Deterministic network models in operations research

Related Items

Entropy bounds for dendrimers, New inequalities between information measures of network information content, Probabilistic inequalities for evaluating structural network measures, A history of graph entropy measures, Bounds for degree-based network entropies

Cites Work

• Information processing in complex networks: Graph entropy and information functionals
• Parallel concepts in graph theory
• Some bounds on entropy measures in information theory
• Information theoretic measures of UHG graphs with low computational complexity
• Information theoretical analysis of ecological networks
• On Graph Complexity
• ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS
• Elements of Information Theory
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item