Related papers: Implementation of Lenia as a Reaction-Diffusion Sy…
A new formulation of special relativity is described. It is based on a postulate that the universe is a vast Cellular Automata (CA). We show that any CA model automatically leads to a maximum speed limit for the transfer of information from…
Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
Q-conditional symmetries (nonclassical symmetries) for a general class of two-component reaction-diffusion systems with constant diffusivities are studied. Using the recently introduced notion of Q-conditional symmetries of the first type…
We present some computer simulations run on a stochastic CA (cellular automaton). The CA simulates a gas of particles which are in a channel, the interval $[1,L]$ in $\mathbb Z$, but also in "reservoirs" $\mathcal R_1$ and $\mathcal R_2$.…
Reaction diffusion systems describe the behaviour of dynamic, interacting, particulate systems. Quantum stochastic processes generalise Brownian motion and Poisson processes, having operator valued It\^{o} calculus machinery. Here it is…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
In this paper, we study the problem of identifying the impulse response of a linear time invariant (LTI) dynamical system from the knowledge of the input signal and a finite set of noisy output observations. We adopt an approach based on…
A new paradigm for the unification of physics is described. It is called Cellular Automata (CA) theory, which is the most massively parallel computer model currently known to science. We maintain that at the tiniest distance and time scales…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
Aggregations are emergent features common to many biological systems. Mathematical models to understand their emergence are consequently widespread, with the aggregation-diffusion equation being a prime example. Here we study the…
We investigate a broad family of non weakly reversible stochastically modeled reaction networks (CRN), by looking at their steady-state distributions. Most known results on stationary distributions assume weak reversibility and zero…
Classical $(1+1)D$ cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of non-equilibrium phenomena. Such systems evolve in discrete time-steps, and are thus free of time-discretisation…
Nonlinear reaction-diffusion systems admit a wide variety of spatiotemporal patterns or structures. In this lecture, we point out that there is certain advantage in studying discrete arrays, namely cellular neural/nonlinear networks (CNNs),…
We consider a reaction-diffusion process with retardation. The particles, immersed in traps initially, remain inactive until another particle is annihilated spontaneously with a rate $\lambda$ at a certain point $\vec x$. In that case the…
Recurrent Neural Networks (RNNs) have been a prominent concept within artificial intelligence. They are inspired by Biological Neural Networks (BNNs) and provide an intuitive and abstract representation of how BNNs work. Derived from the…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…
A kinetic description of lattice-gas automaton models for reaction-diffusion systems is presented. It provides corrections to the mean-field rate equations in the diffusion-limited regime. When applied to the two-species Maginu model, the…