Related papers: Cyclic Cellular Automata and Greenberg-Hastings Mo…
We present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA…
We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and…
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…
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…
The Hubbard model is reformulated in terms of different ``colored'' fermion species for the electrons or holes at different lattice sites. Antiferromagnetic ordering or d-wave superconductivity can then be described in terms of…
We study spontaneous symmetry breaking in a one-dimensional driven two-species stochastic cellular automaton with parallel sublattice update and open boundaries. The dynamics are symmetric with respect to interchange of particles. Starting…
Given a graph $G$, a colouring of $G$ is \emph{acyclic} if it is a proper colouring of $G$ and every cycle contains at least three colours. Its acyclic chromatic number $\chi_a(G)$ is the minimum~$k$ such that an acyclic $k$-colouring of…
Disordered systems such as spin glasses have been used extensively as models for high-dimensional random landscapes and studied from the perspective of optimization algorithms. In a recent paper by L. Addario-Berry and the second author,…
The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…
Cellular automata can show well known features of quantum mechanics, such as a linear updating rule that resembles a discretized form of the Schr\"odinger equation together with its conservation laws. Surprisingly, a whole class of…
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
We study two common types of time-noncontinuous updates for one dimensional stochastic cellular automata with arbitrary nearest neighbor interactions and arbitrary open boundary conditions. We first construct the stationary states using the…
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic…
A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph $G$, denoted by $\theta(G)$, is the minimum number of colors $k$ so that every $k$-coloring of $G$ is…
We study three models of driven sandpile-type automata in the presence of quenched random defects. When the dynamics is conservative, all these models, termed the random sites (A), random bonds (B), and random slopes (C), self-organize into…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…
Since it was first discussed by Baxter in 1970, the three coloring model has been studied in several contexts, from frustrated magnetism to superconducting devices and glassiness. In presence of interactions, when the model is no longer…
We first consider the following problem. We are given a fixed perfect matching $M$ of $[n]$ and we add random edges one at a time until there is a Hamilton cycle containing $M$. We show that w.h.p. the hitting time for this event is the…