For, the-neighbor bootstrap process in a graph starts with a set of infected vertices and, in
each time step, every vertex with at least infected neighbors becomes infected. The initial …

We study monotone cellular automata (also known as 𝒰‐bootstrap percolation) in ℤ d Z^ d
with random initial configurations. Confirming a conjecture of Balister, Bollobás, Przykucki …

Given $ r\geq2 $ and an $ r $-uniform hypergraph $ F $, the $ F $-bootstrap process starts
with an $ r $-uniform hypergraph $ H $ and, in each time step, every hyperedge which" …

We study two tightly related classes of statistical mechanics models on the two-dimensional
square lattice—kinetically constrained models and bootstrap percolation. The former arose …

For $ r\geq1 $, the $ r $-neighbour bootstrap process in a graph $ G $ starts with a set of
infected vertices and, in each time step, every vertex with at least $ r $ infected neighbours …

In the polluted bootstrap percolation model, the vertices of a graph are independently
declared initially occupied with probability p or closed with probability q. At subsequent …

In this paper, we study the evolution of the zero-temperature random field Ising model as the
mean of the external field $ M $ increases from $-\infty $ to $\infty $. We focus on two types of …

We consider three-state cellular automata in two dimensions in which two colored states,
blue and red, compete for control of the empty background, starting from low initial densities …

We study two tightly related classes of statistical mechanics models on the two-dimensional
square lattice—kinetically constrained models and bootstrap percolation. The former arose …

TIME SCALES OF THE FREDRICKSON-ANDERSEN MODEL ON POLLUTED Z2 AND Z3 1.
Introduction The Fredrickson-Andersen k-spin facilitated Page 1 TIME SCALES OF THE …