Quantifying Self-Organization with Optimal Predictors

Abstract

Despite broad interest in self-organizing systems, there are few quantitative, experimentally-applicable criteria for self-organization. The existing criteria all give counter-intuitive results for important cases. In this Letter, we propose a new criterion, namely an internally-generated increase in the statistical complexity, the amount of information required for optimal prediction of the system's dynamics. We precisely define this complexity for spatially-extended dynamical systems, using the probabilistic ideas of mutual information and minimal sufficient statistics. This leads to a general method for predicting such systems, and a simple algorithm for estimating statistical complexity. The results of applying this algorithm to a class of models of excitable media (cyclic cellular automata) strongly support our proposal.

Four pages, two color figures

Cited by in corpus (32)

• Kernel method for nonlinear Granger causality
• Local information transfer as a spatiotemporal filter for complex systems
• Complexity and Information: Measuring Emergence, Self-organization, and Homeostasis at Multiple Scales
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• Automatic Filters for the Detection of Coherent Structure in Spatiotemporal Systems
• The Computational Structure of Spike Trains
• An information-theoretic approach to self-organisation: Emergence of complex interdependencies in coupled dynamical systems
• Bayesian Structural Inference for Hidden Processes
• Experimental quantum processing enhancement in modelling stochastic processes
• Complexity analysis of the stock market
• Information Measures for Long-Range Correlated Sequences: the Case of the 24 Human Chromosome Sequences
• Various complexity measures in confined hydrogen atom
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• The classical-quantum divergence of complexity in modelling spin chains
• Information-theoretic bound on the energy cost of stochastic simulation
• Long-Range Dependence in Financial Markets: a Moving Average Cluster Entropy Approach
• Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton
• Discovering Causal Structure with Reproducing-Kernel Hilbert Space $\epsilon$-Machines
• Quantifying the complexity of random Boolean networks
• Fractality and Self-organization in the Orthodox Iconography
• Quantifying Self-Organization with Optimal Wavelets
• Point Information Gain and Multidimensional Data Analysis
• Leave-one-out prediction error of systolic arterial pressure time series under paced breathing
• Increasing complexity with quantum physics
• Visualizing computation in large-scale cellular automata
• A synthesis and a practical approach to complex systems
• Multiscale Entropy in the Spatial Context of Cities
• The Role of Evolution in Machine Intelligence
• Quantifying Emergence in terms of Persistent Mutual Information
• The LICORS Cabinet: Nonparametric Algorithms for Spatio-temporal Prediction
• Measuring complexity
• Predictive complexity of quantum subsystems