Structural Information and Dynamical Complexity of Networks

DOI10.1109/TIT.2016.2555904MaRDI QIDQ2976783zbMATH OpenFDO

Authors Yicheng Pan, Angsheng Li

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2016.2555904

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Measures of information, entropy (94A17)

Cited in

(10)

• New algorithms for a simple measure of network partitioning
• A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• Quantifying networks complexity from information geometry viewpoint
• A new information dimension of complex networks
• New algorithms for a simple measure of network partitioning
• Graphs with minimum degree-entropy
• Incremental measurement of structural entropy for dynamic graphs
• Hierarchical decision making based on structural information principles
• Statistical mechanics of organization, information, and emergence in protein networks

This page was built for publication: Structural Information and Dynamical Complexity of Networks

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