New inequalities between information measures of network information content

DOI10.1155/2013/175769MaRDI QIDQ460228zbMATH OpenOpenAlexWikidataFDO

Authors Pantelimon-George Popescu, Florin Pop, Alexandru Herişanu, Nicolae Ţăpuş

Publication date 13 October 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/175769

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Inequalities for sums, series and integrals (26D15)

Recommendations

• Inequalities for entropy-based measures of network information content
• On an inequality from information theory
• New upper bound and lower bound for degree-based network entropy
• scientific article; zbMATH DE number 1958489
• scientific article; zbMATH DE number 1751444

Cites work

• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 3228255 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Elements of Information Theory
• Inequalities for entropy-based measures of network information content
• Information processing in complex networks: Graph entropy and information functionals
• Traffic dynamics on complex networks: a survey

Cited in

(2)

• Inequalities for entropy-based measures of network information content
• Probabilistic inequalities for evaluating structural network measures

This page was built for publication: New inequalities between information measures of network information content

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