How should complexity scale with system size?

DOI10.1140/EPJB/E2008-00134-9MaRDI QIDQ978658zbMATH OpenOpenAlexWikidataFDO

Authors Eckehard Olbrich, Nils Bertschinger, Nihat Ay, Jürgen Jost

Publication date 25 June 2010

Published in The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1140/epjb/e2008-00134-9

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• MULTISCALE COMPLEXITY/ENTROPY
• Measures of statistical complexity: why?
• Complexity through nonextensivity
• An axiomatic approach to network complexity
• Natural complexity, computational complexity and depth

Cites work

• A geometric approach to complexity
• COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
• Predictability, complexity, and learning
• Regularities unseen, randomness observed: Levels of entropy convergence
• Toward a quantitative theory of self-generated complexity

Cited in

(9)

• Synergy, redundancy, and multivariate information measures: an experimentalist's perspective
• A multivariate extension of mutual information for growing neural networks
• Information geometry on complexity and stochastic interaction
• Information geometric methods for complexity
• MULTISCALE COMPLEXITY/ENTROPY
• A geometric approach to complexity
• Complexity of quantum-mechanical evolutions from probability amplitudes
• Approximate maximizers of intricacy functionals
• Properties of the statistical complexity functional and partially deterministic HMMs

This page was built for publication: How should complexity scale with system size?

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