Complexity of networks

DOI10.1142/9789812701497_0019MaRDI QIDQ3388726zbMATH OpenOpenAlexFDO

Authors Russell K. Standish

Publication date 6 May 2021

Published in Recent Advances in Artificial Life (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812701497_0019

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

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

Cited in

(21)

• An approach to the physics of complexity
• Information theory of complex networks: on evolution and architectural constraints
• On congruity of nodes and assortative information content in complex networks
• Three Types of Network Complexity Pyramid
• Analyzing complex networks evolution through Information Theory quantifiers
• Functional complexity based on topology
• Complexity, networks, and non-uniqueness
• Spectral complexity of directed graphs and application to structural decomposition
• Thermodynamic depth in undirected and directed networks
• Malleability of complex networks
• Measurement methods on the complexity of network
• Information-based complexity of networks
• The complexity of computations by networks
• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• On sequential structures in incompressible multidimensional networks
• Advances in network complexity
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
• Selection-based estimates of complexity unravel some mechanisms and selective pressures underlying the evolution of complexity in artificial networks
• An axiomatic approach to network complexity
• Measurement of network complexity and capability in command and control system
• Algorithmic networks: central time to trigger expected emergent open-endedness

This page was built for publication: Complexity of networks

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