Entropy of Digraphs and Infinite Networks

DOI10.1007/978-0-8176-4904-3_1MaRDI QIDQ4900003zbMATH OpenOpenAlexFDO

Authors Abbe Mowshowitz

Publication date 11 January 2013

Published in Towards an Information Theory of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-8176-4904-3_1

zbMATH Keywords

digraphsentropyinfinite graphsinformation contentnetworks

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 167195
• Entropy and the complexity of graphs revisited
• On the possible values of the entropy of undirected graphs
• On the von Neumann entropy of graphs
• Szeged-like entropies of graphs
• Spectrum and entropy for infinite directed graphs
• scientific article; zbMATH DE number 7410277
• On extremal properties of graph entropies
• On the von Neumann entropy of a graph
• Hypergraphs, entropy, and inequalities

Cited in

(7)

• Compression and symmetry of small-world graphs and structures
• Perfection, imperfection, and graph entropy
• scientific article; zbMATH DE number 3937195 (Why is no real title available?)
• On the possible values of the entropy of undirected graphs
• Graph information ratio
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Structural information content of networks: graph entropy based on local vertex functionals

This page was built for publication: Entropy of Digraphs and Infinite Networks

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