Monotone cellular automata in a random environment

Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with probability $p$ between any pair of vertices. Bootstrap percolation on a random graph is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have ...

We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage percolation as its extreme points. We give a precise description of the evolution of this process on the graph $\mathbb{Z}^2$, significantly sharpening results of Dehghanpour and Schonmann. In particular, we determine the typical infection time ...

Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the Ising model, on an n x n square, with sites initially infected independently with probability p. The critical probability p_c is the smallest p for which the probability that the entire square is eventually infected exceeds 1/2. Holroyd de...

Dynamic properties of a one-dimensional probabilistic cellular automaton are studied by monte-carlo simulation near a critical point which marks a second-order phase transition from a active state to a effectively unique absorbing state. Values obtained for the dynamic critical exponents indicate that the transition belongs to the universality class of directed percolation. Finally the model is compared with a previously studied one to show that a difference in the nature of ...

In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. Percolation occurs if eventually every vertex is infected. The elements of the set of initially infected vertices, A \subset V(G), are normally chosen independently at random, each with probability p, say. This process ...

Recent years have seen a great deal of progress in our understanding of bootstrap percolation models, a particular class of monotone cellular automata. In the two dimensional lattice there is now a quite satisfactory understanding of their evolution starting from a random initial condition, with a strikingly beautiful universality picture for their critical behaviour. Much less is known for their non-monotone stochastic counterpart, namely kinetically constrained models (KCM)...

We introduce a new class of two-dimensional cellular automata with a bootstrap percolation-like dynamics. Each site can be either empty or occupied by a single particle and the dynamics follows a deterministic updating rule at discrete times which allows only emptying sites. We prove that the threshold density $\rho_c$ for convergence to a completely empty configuration is non trivial, $0<\rho_c<1$, contrary to standard bootstrap percolation. Furthermore we prove that in the ...

Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$, where $a_1\le a_2\le a_3$. Suppose we infect any healthy vertex $v\in [L]^3$ already having $r$ infected neighbours, and that infected sites remain infected forever. In this paper we determine $\log$ of the critical length for percolation u...

In this paper we consider kinetically constrained models (KCM) on $\mathbb Z^2$ with general update families $\mathcal U$. For $\mathcal U$ belonging to the so-called "critical class" our focus is on the divergence of the infection time of the origin for the equilibrium process as the density of the facilitating sites vanishes. In a recent paper Mar\^ech\'e and two of the present authors proved that if $\mathcal U$ has an infinite number of "stable directions", then on a doub...

In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get infected in subsequent rounds if they have at least $r$ infected neighbours. A graph $G$ \emph{percolates} if every vertex becomes eventually infected. A central problem in this process is to determine the critical probability $p_c(G,r)$, at whi...