Information-based complexity of networks

DOI10.1002/9783527670468.CH09MaRDI QIDQ3463390zbMATH OpenOpenAlexFDO

Authors Russell K. Standish

Publication date 14 January 2016

Published in Advances in Network Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.2696

zbMATH Keywords

Boolean networksdynamical processesGaussian processesinformation-based measuresnetwork complexity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)

Abstract: Review article of various complexity measures of networks

Recommendations

• Complexity of networks
• Functional complexity based on topology
• Measurement methods on the complexity of network
• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• Entropy and the complexity of graphs revisited

Cited in

(15)

• Some implications of interval approach to dimension for network complexity
• Statistical complexity and connectivity relationship in cultured neural networks
• Maximal entropy coverings and the information dimension of a complex network
• Measurement methods on the complexity of network
• Complexity of networks
• Functional complexity based on topology
• How complex a dynamical network can be?
• Flow complexity in open systems: interlacing complexity index based on mutual information
• Quantifying networks complexity from information geometry viewpoint
• Measurement of network complexity and capability in command and control system
• Theory Is Forever
• On the capacity of information networks
• A new information dimension of complex networks
• Effects of parity, frustration, and stochastic fluctuations on integrated conceptual information for networks with two small-sized loops
• Measures for information propagation in Boolean networks

This page was built for publication: Information-based complexity of networks

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