Related papers: Complexity of 2D bootstrap percolation difficulty:…
Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two…
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…
In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising…
We study the class of monotone, two-state, deterministic cellular automata, in which sites are activated (or 'infected') by certain configurations of nearby infected sites. These models have close connections to statistical physics, and…
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…
We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}^d$ with random initial configurations. Confirming a conjecture of Balister, Bollob\'as, Przykucki and Smith, who proved the corresponding…
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollob\'as in 1968, and is defined as follows. Given a graph $H$, and a set $G \subset E(K_n)$ of initially `infected' edges, we infect, at each time…
The main purpose of percolation theory is to model phase transitions in a variety of random systems, which is highly valuable in fields related to materials physics, biology, or otherwise unrelated areas like oil extraction or even quantum…
We establish new connections between percolation, bootstrap percolation, probabilistic cellular automata and deterministic ones. Surprisingly, by juggling with these in various directions, we effortlessly obtain a number of new results in…
By bootstrap percolation we mean the following deterministic process on a graph $G$. Given a set $A$ of vertices "infected" at time 0, new vertices are subsequently infected, at each time step, if they have at least $r\in\mathbb{N}$…
In this paper we investigate the critical probability $p_c(Q_n,r)$ for bootstrap percolation with the infection threshold $r$ on the $n$-dimensional hypercube $Q_n$ with vertex set $V(Q_n)=\{0,1\}^n$ and edges connecting the pairs at…
The class of critical bootstrap percolation models in two dimensions was recently introduced by Bollob\'as, Smith and Uzzell, and the critical threshold for percolation was determined up to a constant factor for all such models by the…
We prove that there exist natural generalizations of the classical bootstrap percolation model on $\mathbb{Z}^2$ that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this…
We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with…
We consider the robustness of computational hardness of problems whose input is obtained by applying independent random deletions to worst-case instances. For some classical $NP$-hard problems on graphs, such as Coloring, Vertex-Cover, and…
Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $\omega_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least…
In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension of the classical framework of Toom. This…
We study a general class of interacting particle systems called kinetically constrained models (KCM) in two dimensions. They are tightly linked to the monotone cellular automata called bootstrap percolation. Among the three classes of such…
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…
We study two-dimensional critical bootstrap percolation models. We establish that a class of these models including all isotropic threshold rules with a convex symmetric neighbourhood, undergoes a sharp metastability transition. This…