SearcharxivSearch

arXiv · 1602.03055

Multi-state stochastic hotchpotch model gives rise to the observed mesoscopic behaviour in the non-stirred Belousov--Zhabotinsky reaction

Abstract

Mesoscopic dynamics of self-organized structures is the most important aspect in the description of complex living systems. The Belousov--Zhabotinsky (B--Z) reaction is in this respect a convenient testbed because it represents a prototype of chemical self-organization with a rich variety of emergent wave-spiral patterns. Using a multi-state stochastic hotchpotch model, we show here that the mesoscopic behaviour of the non-stirred B--Z reaction is both qualitatively and quantitatively susceptible to the description in terms of stochastic multilevel cellular automata. This further implies that the mesoscopic dynamics of the non-stirred B--Z reaction results from a delicate interplay between a) a maximal number of available states within the elementary time lag (i.e. a minimal time interval needed for demise of a final state) and b) an imprecision or uncertainty in the definition of state. If either the number of time lags is largely different from 7 or the maximal number of available states is smaller than 20, the physicochemical conditions are inappropriate for a formation of the wave-spiral patterns. Furthermore, a white noise seems to be key for the formation of circular structures (target patterns) which could not be as yet systematically explained in existing models.

Explore related subjects

Keep this discovery

BibTeXRIS

Dalibor Štys, Petr Jizba, Anna Zhyrova, Renata Rychtáriková, Kryštof M. Štys, Tomáš Náhlík. 2016-02-06. Multi-state stochastic hotchpotch model gives rise to the observed mesoscopic behaviour in the non-stirred Belousov--Zhabotinsky reaction. https://arxiv.org/abs/1602.03055

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