Searcharxiv⌕ Search

arXiv · nlin/0612047

Boolean Delay Equations: A simple way of looking at complex systems

Abstract

Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time. They represent therewith metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts``. All known solutions of dissipative BDEs have stationary variance. BDE systems of this type, both free and forced, have been used as highly idealized models of climate change on interannual, interdecadal and paleoclimatic time scales. BDEs are also being used as flexible, highly efficient models of colliding cascades in earthquake modeling and prediction, as well as in genetics. In this paper we review the theory of systems of BDEs and illustrate their applications to climatic and solid earth problems. The former have used small systems of BDEs, while the latter have used large networks of BDEs. We moreover introduce BDEs with an infinite number of variables distributed in space (``partial BDEs``) and discuss connections with other types of dynamical systems, including cellular automata and Boolean networks. This research-and-review paper concludes with a set of open questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Ghil, Ilya Zaliapin, Barbara Coluzzi. 2007-10-24. Boolean Delay Equations: A simple way of looking at complex systems. https://doi.org/10.1016/j.physd.2008.07.006. https://searcharxiv.com/abs/nlin/0612047

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Certificates of Immortality for Gliders on the Hat and Spectre Tilings

Cellular automata on the hat and spectre monotilings support gliders: localized patterns that travel at constant speed and heading on a tiling that has no translational symmetry. An earlier paper found them by search and left open whether they travel forever; here it is settled by finite computation. A certificate is a finite set of local situations, a pattern with a collar of terrain, closed under the rule on every environment the tiling can present, the environments enumerated by the tilings' substitution transducer. Seven closed sets, covering the earlier paper's gliders, prove that each never dies on any tiling of its hull and holds its heading inside a rigorous interval. Three further gliders, from a rule hand-designed in 2023, one found independently in 2026, and the author's spectre rule moved to the hat, certify on the lane the hat gliders share, with the same cocycle. An independent program re-derives each certificate.

nlin.CG↗

Exact Lyapunov spectra of affine cellular automata and the parity rule on networks

The Lyapunov exponent quantifies the sensitivity of a dynamical system to perturbations, and the full Lyapunov spectrum extends this to every orthogonal direction in tangent space. For cellular automata the spectrum is almost always approximated numerically, and the approximation is delicate. We show that the affine rules, those whose update is an XOR of a subset of the inputs together with a constant, admit an exact Lyapunov spectrum. An affine rule has a configuration-independent Boolean Jacobian, so the spectrum reduces to the logarithms of the eigenvalue moduli of a single constant matrix, with no simulation and no limit involved. Two cases are shown to carry a closed form. For an affine cellular automaton on a periodic lattice the Jacobian is a multilevel circulant matrix, and its eigenvalues are given by the discrete Fourier transform of the rule's gradient stencil, valid in any spatial dimension. For the parity rule on an arbitrary graph the Jacobian is the adjacency matrix, plus the identity in the self-inclusive case, so the spectrum is the logarithm of the absolute spectrum of that matrix, and the maximal exponent the logarithm of its spectral radius. In both cases the exact spectra serve as benchmarks: they expose errors in previously reported spectra, and turn the informal correspondence between spectral radius and tangent-space sensitivity into an exact identity.

nlin.CG↗

Computing functions through the orbits of dynamical systems: the case of cellular automata

Computing a function traditionally involves constructing a formula, circuit, or program specifically designed for that function. But could a single, fixed computational structure generate an entire universe of functions simply by evolving over time? More generally, to what extent can the expressive power of a dynamical system be measured by the functions emerging along its orbits? We investigate this question in a setting where computation is driven by repeated application of one elementary operation, uniformly distributed in space and unchanged over time. Using cellular automata as a model of homogeneous dynamics, we consider systems whose states represent Boolean functions rather than Boolean values. Starting from a simple configuration containing only input variables and constants, the system evolves autonomously, generating new functions at different spatial positions and times. Unlike conventional function synthesis, no function-specific circuit, program, or operation sequence is constructed: the architecture remains fixed, and functions are identified by their space-time location. We ask which elementary rules can generate every Boolean function of a given number of variables along a single orbit, and whether this functional universality persists as the number of variables increases. We develop algebraic and dynamical criteria separating universal from non-universal behavior, and obtain a complete classification of elementary-rule symmetry classes for three-variable functions. Particularly intriguing is Rule 30, for which simple initial configurations generate all Boolean functions of up to five variables, suggesting possible universality for arbitrarily many variables. Our results support a view of computation in which functional diversity arises not from increasingly elaborate architectures, but from the space-time evolution of a single simple dynamical law.

nlin.CG↗