SearcharxivSearch

arXiv · 0804.1507

Predictability of the large relaxations in a cellular automaton model

Abstract

A simple one-dimensional cellular automaton model with threshold dynamics is introduced. The cumulative distribution of the size of the relaxations is analytically computed and behaves as a power law with an exponent equal to -1. This coincides with the phenomenological Gutenberg-Richter behavior observed in Seismology for the cumulative statistics of earthquakes at the regional or global scale. The key point of the model is the zero-load state of the system after the occurrence of any relaxation, no matter what its size. This leads to an equipartition of probability between all possible load configurations in the system during the successive loading cycles. Each cycle ends with the occurrence of the greatest -or characteristic- relaxation in the system. The duration of the cycles in the model is statistically distributed with a coefficient of variation ranging from 0.5 to 1. The predictability of the characteristic relaxations is evaluated by means of error diagrams. This model illustrates the value of taking into account the refractory periods to obtain a considerable gain in the quality of the predictions.

Explore related subjects

Keep this discovery

BibTeXRIS

Alejandro Tejedor, Samuel Ambroj, Javier B. Gómez, Amalio F. Pacheco. 2008-08-20. Predictability of the large relaxations in a cellular automaton model. https://doi.org/10.1088/1751-8113/41/37/375102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG