Related papers: (Biased) Majority Rule Cellular Automata
We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better decision, which is correct with probability $1/2+\delta$. The…
Teams of networked autonomous agents have been used in a number of applications, such as mobile sensor networks and intelligent transportation systems. However, in such systems, the effect of faults and errors in one or more of the…
We consider the problem of metastability for stochastic reversible dynamics with exponentially small transition probabilities. We generalize previous results in several directions. We give an estimate of the spectral gap of the transition…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
We prove that a semi-implicit time Euler scheme for the two-dimensional B\'enard-Boussinesq model on the torus D converges. The rate of convergence in probability is almost 1/2 for a multiplicative noise; this relies on moment estimates in…
We consider the problem of regulating by means of external control inputs the ratio of two cell populations. Specifically, we assume that these two cellular populations are composed of cells belonging to the same strain which embeds some…
A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…
Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an…
Consider a graph $G$ and an initial coloring, where each node is blue or red. In each round, all nodes simultaneously update their color based on a predefined rule. In a threshold model, a node becomes blue if a certain number or fraction…
Toom's north-east-self voting cellular automaton rule R is known to suppress small minorities. A variant which we call R^+ is also known to turn an arbitrary initial configuration into a homogenous one (without changing the ones that were…
The path-preference traffic flow cellular automaton is suggested to model the dynamics of transcription. The main difference from the simple traffic flow model is that it contains another preferential paths at some sites. In this paper, we…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these…
The rule 184 fuzzy cellular automaton is regarded as a mathematical model of traffic flow because it contains the two fundamental traffic flow models, the rule 184 cellular automaton and the Burgers equation, as special cases. We show that…
An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…
Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k - 1$ colors. CA-connectivity is an equivalence relation dividing the…
We introduce and analyze a voter-type model on a two-layer multiplex network, where the presence of a state on one layer acts as a catalyst or inhibitor to the propagation of that state on the other layer. Despite the model's simplicity,…