Search arXivSearch

arXiv · 2002.06112

Formation of morphogenetic patterns in cellular automata

Abstract

One of the most important problems in contemporary science, and especially in biology, is to reveal mechanisms of pattern formation. On the level of biological tissues, patterns form due to interactions between cells. These interactions can be long-range if mediated by diffusive molecules or short-range when associated with cell-to-cell contact sites. Mathematical studies of long-range interactions in-volve models based on differential equations while short-range interactions are modelled using discrete type models. In this paper, we use cellular automata (CA) technique to study formation of patterns due to short-range interactions. Namely, we use von Neumann cellular automata represented by a finite set of lattices whose states evolve according to transition rules. Lattices can be considered as representing biological cells (which, in the simplest case, can only be in one of the two different states) while the transition rules define changes in their states due to the cell-to-cell contact interactions. In this model, we identify rules result-ing in the formation of stationary periodic patterns. In our analysis, we distin-guish rules which do not destroy preset patterns and those which cause pattern formation from random initial conditions. Also, we check whether the forming patterns are resistant to noise and analyze the time frame for their formation. Transition rules which allow formation of stationary periodic patterns are then discussed in terms of pattern formation in biology.

Explore related subjects

Keep this discovery

BibTeXRIS

Manan'Iarivo Rasolonjanahary, Bakhtier Vasiev. 2020-02-14. Formation of morphogenetic patterns in cellular automata. https://arxiv.org/abs/2002.06112

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