Related papers: Randomly connected cellular automata: A search for…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
We study the effect of mixing two rules on the dynamics of one-dimensional cellular automata by large scale numerical simulations. We calculate the decay of the magnetization for the Domany-Kinzel automaton (XOR/AND mixing) to its…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
We study the random connection model driven by a stationary Poisson process. In the first part of the paper, we derive a lace expansion with remainder term in the continuum and bound the coefficients using a new version of the BK…
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the…
We study explosive connectivity and mechanical rigidity in three-dimensional cubic lattice structures under Achlioptas-type product-rule dynamics. Our work combines extensive numerical simulation with the development of a new theoretical…
We study a neural network model of interacting stochastic discrete two--state cellular automata on a regular lattice. The system is externally tuned to a critical point which varies with the degree of stochasticity (or the effective…
We derive the statistical limit of the spectral autocorrelation function and of the survival probability for the indirect photodissociation of molecules in the regime of non-overlapping resonances. The results are derived in the framework…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
We consider a quantum mechanical particle living on a graph and discuss the behaviour of its wavefunction at graph vertices. In addition to the standard (or delta type) boundary conditions with continuous wavefunctions, we investigate two…
Conway's cellular automaton Game of LIFE has been conjectured to be a critical (or quasicritical) dynamical system. This criticality is generally seen as a continuous order-disorder transition in cellular automata (CA) rule space. LIFE's…
A discretized time evolution of the wave function for a Dirac particle on a cubic lattice is represented by a very simple quantum cellular automaton. In each evolution step the updated value of the wave function at a given site depends only…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
We propose a novel generalized cellular automaton(GCA) model for discrete-time pulse-coupled oscillators and study the emergence of synchrony. Given a finite simple graph and an integer $n\ge 3$, each vertex is an identical oscillator of…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where…