Related papers: Wave propagation in filamental cellular automata
The essential ingredient for studying the phenomena of emergence is the ability to generate and manipulate emergent systems that span large scales. Cellular automata are the model class particularly known for their effective scalability but…
We obtain the exact full counting statistics of a cellular automaton with freely propagating vacancies and charged particles that are stochastically scattered or transmitted upon collision by identifying the problem as a colored stochastic…
Cell colonies of bacteria, tumour cells and fungi, under nutrient limited growth conditions, exhibit complex branched growth patterns. In order to investigate this phenomenon we present a simple hybrid cellular automaton model of cell…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
Cell division and death can be regulated by the mechanical forces within a tissue. We study the consequences for the stability and roughness of a propagating interface, by analysing a model of mechanically-regulated tissue growth in the…
Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed…
The processes taking place inside the living cell are now understood to the point where predictive computational models can be used to gain detailed understanding of important biological phenomena. A key challenge is to extrapolate this…
We find a statistical mechanism that can adjust orientations of intracellular filaments to cell geometry in absence of organizing centers. The effect is based on random and isotropic filament (de-)polymerization dynamics and is independent…
In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
Using the concept of the Boolean derivative we study damage spreading for one dimensional elementary cellular automata and define their maximal Lyapunov exponent. A random matrix approximation describes quite well the behavior of…
We study charge fluctuations of a family of stochastic charged cellular automata away from the deterministic single-file limit and obtain the exact typical charge probability distributions, known to be anomalous, using hydrodynamics. The…
This study builds upon a model proposed by Joanny and collaborators that examines the dynamics of interfaces between two distinct cell populations, particularly during tumor growth in healthy tissues. This framework leads to the…
How the cells break symmetry and organize their edge activity to move directionally is a fun- damental question in cell biology. Physical models of cell motility commonly rely on gradients of regulatory factors and/or feedback from the…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a…
Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena. However, when using conventional computers, these 'simple' rules are only encapsulated at the…
We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
We study discretisation effects in cellular automata models for pedestrian dynamics by reducing the cell size. Then a particle occupies more than one cell which leads to subtle effects in the dynamics, e.g. non-local conflict situations.…