Information-based complexity of networks
From MaRDI portal
Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Abstract: Review article of various complexity measures of networks
Recommendations
Cited in
(15)- Statistical complexity and connectivity relationship in cultured neural networks
- A new information dimension of complex networks
- Theory Is Forever
- How complex a dynamical network can be?
- Functional complexity based on topology
- Quantifying networks complexity from information geometry viewpoint
- Measures for information propagation in Boolean networks
- Measurement methods on the complexity of network
- Maximal entropy coverings and the information dimension of a complex network
- Effects of parity, frustration, and stochastic fluctuations on integrated conceptual information for networks with two small-sized loops
- Complexity of networks
- Some implications of interval approach to dimension for network complexity
- On the capacity of information networks
- Measurement of network complexity and capability in command and control system
- Flow complexity in open systems: interlacing complexity index based on mutual information
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)