Measuring complexity

Abstract

Complexity is a multi-faceted phenomenon, involving a variety of features including disorder, nonlinearity, and self-organisation. We use a recently developed rigorous framework for complexity to understand measures of complexity. We illustrate, by example, how features of complexity can be quantified, and we analyse a selection of purported measures of complexity that have found wide application and explain whether and how they measure complexity. We also discuss some of the classic information-theoretic measures from the 1980s and 1990s. This work gives the reader a tool kit for quantifying features of complexity across the sciences.

arXiv comment20 pages, substantially revised and extended version, now published as Chapter in book 'What Is a Complex System?' with Yale University Press (2020)

References in corpus (16)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Power laws, Pareto distributions and Zipf's law
• Lethality and centrality in protein networks
• Maps of random walks on complex networks reveal community structure
• Resolution limit in community detection
• Hierarchical structure and the prediction of missing links in networks
• Weak pairwise correlations imply strongly correlated network states in a neural population
• Statistical mechanics for natural flocks of birds
• Computational Mechanics: Pattern and Prediction, Structure and Simplicity
• Predictability of catastrophic events: material rupture, earthquakes, turbulence, financial crashes and human birth
• 25 Years of Self-Organized Criticality: Concepts and Controversies
• Quantifying Self-Organization with Optimal Predictors
• Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information
• Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics
• Information-theoretic bound on the energy cost of stochastic simulation