Bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at least $r\geq2$ active neighbors become active as well. We study the size $A^*$ of the final active set. The parameters of the model are, besides $r$ (fixed) and $n$ (tending to $\infty$), the size $a=a(n)$ of the initially active set and the probability $p=p(n)$ of the edges in the graph. We show that the model exhibits a sharp phase transition: depending on the parameters of the model, the final size of activation with a high probability is either $n-o(n)$ or it is $o(n)$. We provide a complete description of the phase diagram on the space of the parameters of the model. In particular, we find the phase transition and compute the asymptotics (in probability) for $A^*$; we also prove a central limit theorem for $A^*$ in some ranges. Furthermore, we provide the asymptotics for the number of steps until the process stops.
Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critical initial density p_c(n), is noise sensitive, while in k-neighbour bootstrap percolation on the d-regular random graph G_{n,d}, for 2\leq k\leq d-2, it is insensitive. Many open problems remain.
We study the distribution of the percolation time $T$ of two-neighbour bootstrap percolation on $[n]^2$ with initial set $A\sim\mathrm{Bin}([n]^2,p)$. We determine $T$ with high probability up to a constant factor for all $p$ above the critical probability for percolation, and to within a $1+o(1)$ factor for a large range of $p$.
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in terms of moments of the offspring distributions. With this result we confirm a conjecture of Bollobás, Gunderson, Holmgren, Janson and Przykucki. We also show that these bounds are best possible up to positive constants not depending on the offspring distribution.
A graph $G$ percolates in the $K_{r,s}$-bootstrap process if we can add all missing edges of $G$ in some order such that each edge creates a new copy of $K_{r,s}$, where $K_{r,s}$ is the complete bipartite graph. We study $K_{r,s}$-bootstrap percolation on the Erdős-Rényi random graph, and determine the percolation threshold for balanced $K_{r,s}$ up to a logarithmic factor. This partially answers a question raised by Balogh, Bollobás, and Morris. We also establish a general lower bound of the percolation threshold for all $K_{r,s}$, with $r\geq s \geq 3$.
We study the percolation time of the $r$-neighbour bootstrap percolation model on the discrete torus $(\Z/n\Z)^d$. For $t$ at most a polylog function of $n$ and initial infection probabilities within certain ranges depending on $t$, we prove that the percolation time of a random subset of the torus is exactly equal to $t$ with high probability as $n$ tends to infinity. Our proof rests crucially on three new extremal theorems that together establish an almost complete understanding of the geometric behaviour of the $r$-neighbour bootstrap process in the dense setting. The special case $d-r=0$ o…
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least r infected neighbours. We study the distribution of the time t at which all vertices become infected. Given t = t(n) = o(log n/log log n), we prove a sharp threshold result for the probability that percolation occurs by time t in d-neighbour bootstrap percolation on the d-dimensional discrete torus T_n^d. Moreover, we show that for certain ranges of p = p(n)…
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 approach is not only simpler than the original multi-scale renormalisation proof of the result in two and more dimensions, but also gives significantly better bounds. As a byproduct, we improve the best known bounds for the stability threshold of Toom's North-East-Center majority rule cellular automaton.
Graph bootstrap percolation, introduced by Bollobás in 1968, is a cellular automaton defined as follows. Given a "small" graph $H$ and a "large" graph $G = G_0 \subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding to it all new edges $e$ such that $G_t \cup e$ contains a new copy of $H$. We say that $G$ percolates if for some $t \geq 0$, we have $G_t = K_n$. For $H = K_r$, the question about the size of the smallest percolating graphs was independently answered by Alon, Frankl and Kalai in the 1980's. Recently, Balogh, Bollobás and Morris considered graph bootstrap perc…
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 property. Van Enter (in the case $d=r=2$) and Schonmann (for all $d \geq r \geq 2$) proved that $r$-neighbour bootstrap percolation models have trivial critical probabilities on $\mathbb{Z}^d$ for every choice of the parameters $d \geq r \geq 2$: that is, an initial set of density $p$ almost surely percolates $\mathbb{Z}^d$ for every $p>0$. These results effec…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of the Chung-Lu model. The process starts with infection rate $p=p(N)$. Each uninfected vertex with at least $\mathbf{r}\geq 1$ infected neighbors becomes infected, remaining so forever. We identify a function $p_c(N)=o(1)$ such that a.a.s.\ when $p\gg p_c(N)$ the infection spreads to a positive fraction of vertices, whereas when $p\ll p_c(N)$ the process cannot…
We investigate bootstrap percolation with infection threshold $r> 1$ on the binomial $k$-uniform random hypergraph $H_k(n,p)$ in the regime $n^{-1}\ll n^{k-2}p \ll n^{-1/r}$, when the initial set of infected vertices is chosen uniformly at random from all sets of given size. We establish a threshold such that if there are less vertices in the initial set of infected vertices, then whp only a few additional vertices become infected, while if the initial set of infected vertices exceeds the threshold then whp almost every vertex becomes infected. In addition, for $k=2$, we show that the probabil…
We study the critical probability for the metastable phase transition of the two-dimensional anisotropic bootstrap percolation model with $(1,2)$-neighbourhood and threshold $r = 3$. The first order asymptotics for the critical probability were recently determined by the first and second authors. Here we determine the following sharp second and third order asymptotics: \[ p_c\big( [L]^2,\mathcal{N}_{(1,2)},3 \big) \; = \; \frac{(\log \log L)^2}{12\log L} \, - \, \frac{\log \log L \, \log \log \log L}{ 3\log L} + \frac{\left(\log \frac{9}{2} + 1 \pm o(1) \right)\log \log L}{6\log L}. \] We note…
Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollobás 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 step, a new edge $e$ if there is a copy of $H$ in $K_n$ such that $e$ is the only not-yet infected edge of $H$. We say that $G$ percolates in the $H$-bootstrap process if eventually every edge of $K_n$ is infected. The extremal questions for this model, when $H$ is the complete graph $K_r$, were solved (independently) by Alon, Kalai and Frankl almost thirty ye…
We analyze the metastable states near criticality of the bootstrap percolation on Galton-Watson trees. We find that, depending on the exact choice of the offspring distribution, it is possible to have several distinct metastable states, with varying scaling of their duration while approaching criticality.
Bootstrap percolation is a type of cellular automaton on graphs, introduced as a simple model of the dynamics of ferromagnetism. Vertices in a graph can be in one of two states: `healthy' or `infected' and from an initial configuration of states, healthy vertices become infected by local rules. While the usual bootstrap processes are monotone in the sets of infected vertices, in this paper, a modification is examined in which infected vertices can return to a healthy state. Vertices are initially infected independently at random and the central question is whether all vertices eventually becom…
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 determined the sharp first-order approximation: p_c \sim π^2/(18 log n) as n \to \infty. Here we sharpen this result, prov…
We generalize and improve results of Andrews, Gravner, Holroyd, Liggett, and Romik on metastability thresholds for generalized two-dimensional bootstrap percolation models, and answer several of their open problems and conjectures. Specifically, we prove slow convergence and localization bounds for Holroyd, Liggett, and Romik's k-percolation models, and in the process provide a unified and improved treatment of existing results for bootstrap, modified bootstrap, and Frobose percolation. Furthermore, we prove improved asymptotic bounds for the generating functions of partitions without k-gaps, …
In this paper a random graph model $G_{\mathbb{Z}^2_N,p_d}$ is introduced, which is a combination of fixed torus grid edges in $(\mathbb{Z}/N \mathbb{Z})^2$ and some additional random ones. The random edges are called long, and the probability of having a long edge between vertices $u,v\in(\mathbb{Z}/N \mathbb{Z})^2$ with graph distance $d$ on the torus grid is $p_d=c/Nd$, where $c$ is some constant. We show that, {\em whp}, the diameter $D(G_{\mathbb{Z}^2_N,p_d})=Θ(\log N)$. Moreover, we consider non-monotonous bootstrap percolation on $G_{\mathbb{Z}^2_N,p_d}$. We prove the presence of phase …
Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected neighbours are infected. We say that percolation occurs if eventually all vertices in $G$ become infected. In this paper we study majority bootstrap percolation on the Erdős-Rényi random graph $G(n,p)$ above the connectivity threshold. Perhaps surprisingly, the results obtained for small $p$ are comparable to the results for the hypercube obtained by Balogh, Boll…
Given a hypergraph $\mathcal{H}$, the $\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\mathcal{H}$ in which $v$ is the unique healthy vertex. We say that the set of initially infected vertices percolates if every vertex of $\mathcal{H}$ is eventually infected. We show that this process exhibits a sharp threshold when $\mathcal{H}$ is a hypergraph obtained by randomly sampling hyperedges from an approximately $d$-regular $r$-uniform hypergraph satisfying some…
Following Bradonjić and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a vertex is $a\log n$ for some fixed $a>1$. Each vertex is added with probability $p$ to a set $A_0$ of initially infected vertices. Vertices subsequently become infected if they have at least $ θa \log n $ infected neighbours. Here $p, θ\in [0,1]$ are taken to be fixed constants. We show that if $θ< (1+p)/2$, then a sufficiently large local outbreak leads with…
In \emph{$k$-bootstrap percolation}, we fix $p\in (0,1)$, an integer $k$, and a plane graph $G$. Initially, we infect each face of $G$ independently with probability $p$. Infected faces remain infected forever, and if a healthy (uninfected) face has at least $k$ infected neighbors, then it becomes infected. For fixed $G$ and $p$, the \emph{percolation threshold} is the largest $k$ such that eventually all faces become infected, with probability at least $1/2$. For a large class of infinite graphs, we show that this threshold is independent of $p$. We consider bootstrap percolation in tilings o…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each round every susceptible vertex which has at least $r\geq 2$ infected neighbours becomes infected and remains so forever. Assume that initially $a(t)$ vertices are randomly infected, where $t$ is the total number of vertices of the graph. Suppose also that $r < m$, where $2m$ is the average degree. We determine a critical function $a_c(t)$ such that…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $θ$ occupied neighbors. The initially occupied set is random, given by a uniform product measure with a low density $p$. Our main focus is on this process on the product graph $\mathbb{Z}^2\times K_n^2$, where $K_n$ is a complete graph. We investigate how $p$ scales with $n$ so that a typical site is eventually occupied. Under critical scaling, the dynamics with even $θ$ exhibits a sharp phase transition, while odd $θ$ yields a gradual percolation tran…
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 has been extensively studied on the sequence of torus graphs [n]^d, for n = 1,2,..., where d = d(n) is either fixed or a v…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have a certain number of active neighbors. A recurring feature in bootstrap percolation theory is an `all-or-nothing' phenomenon: either the size of the starting set is so small that the process stops very soon, or it percolates (almost) completely. Motivated by several important phenomena observed in various types of real-world networks we propose in this work a…
This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimensional Hamming torus where each node is open with probability $p$ and the percolation threshold is 2. For each $d'<d$ we find the critical exponent for the event that a $d'$-dimensional subtorus becomes open and compute the limiting value of its probability under the critical scaling. For even $d'$, we use the Chen-Stein method to show that the number of $d'$-dimensional subtori that become open can be approximated by a Poisson random variable.
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 model of ferromagnetism, and kinetically constrained spin models of the liquid-glass transition, the most extensively-studied case is the two-neighbour bootstrap process on the two-dimensional grid $[n]^2$. Around 15 years ago, in a major breakthrough, Holroyd determined the sharp threshold for percolation in this model, and his bounds were subsequently sha…
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within a (small) local region. We show that the process exhibits a phase transition in terms of the initial infection rate in this region. We determine the speed of the process in the supercritical case, up to lower order terms, and show that its evolution is fundamentally influenced by the underlying geometry. For vertices with given position and expected degree, …
We study the following bootstrap percolation process: given a connected graph $G$, a constant $ρ\in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a $ρ$-proportion of its neighbours are already infected (once infected, a vertex remains infected forever). Our focus is on the size $h_ρ(G)$ of a smallest initial set which is \emph{contagious}, meaning that this process results in the infection of every vertex of $G$. Our main result states that every connected graph $G$ on $n$ vertices has $h_ρ(G) < 2ρn$ or $h_ρ(G)…
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}$ previously infected neighbors. When the set $A$ is chosen at random, the main aim is to determine the critical probability $p_c(G,r)$ at which percolation (infection of the entire graph) becomes likely to occur. This bootstrap process has been extensively studied on the $d$-dimensional grid $[n]^d$: with $2\leq r\leq d$ fixed, it was proved by Cerf and Cirillo (for…
In this paper we analyze several anisotropic bootstrap percolation models in three dimensions. We present the order of magnitude for the metastability threshold for a fairly general class of models. In our proofs we use an adaptation of the technique of dimensional reduction. We find that the order of the metastability threshold is generally determined by the "easiest growth direction" in the model. In contrast to the anisotropic bootstrap percolation in two dimensions, in three dimensions the order of the metatstability threshold for anisotropic bootstrap percolation can be equal to that of i…
Consider the following model of strong-majority bootstrap percolation on a graph. Let r be some positive integer, and p in [0,1]. Initially, every vertex is active with probability p, independently from all other vertices. Then, at every step of the process, each vertex v of degree deg(v) becomes active if at least (deg(v)+r)/2 of its neighbours are active. Given any arbitrarily small p>0 and any integer r, we construct a family of d=d(p,r)-regular graphs such that with high probability all vertices become active in the end. In particular, the case r=1 answers a question and disproves a conjec…
Bootstrap percolation models have been extensively studied during the two past decades. In this article, we study the following "anisotropic" bootstrap percolation model: the neighborhood of a point (m,n) is the set \[\{(m+2,n),(m+1,n),(m,n+1),(m-1,n),(m-2,n),(m,n-1)\}.\] At time 0, sites are occupied with probability p. At each time step, sites that are occupied remain occupied, while sites that are not occupied become occupied if and only if three of more sites in their neighborhood are occupied. We prove that it exhibits a sharp metastability threshold. This is the first mathematical proof …
In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the elements of $A$ are chosen independently with some probability $p$, it is natural to study the critical probability $p_c(G,r)$ at which it becomes likely that all of $V(G)$ will eventually become infected. Improving a result of Balogh, Bollobás, and Morris, we give a bound on the second term in the expansion of the critical probability when $G = [n]^d$ and $d \g…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a graph in one of two states: `infected' or `healthy'. In consecutive rounds, each healthy vertex with at least $r$ infected neighbours becomes itself infected. Percolation is said to occur if every vertex is eventually infected. Usually, the starting set of infected vertices is chosen at random, with all vertices initially infected independently with probability …
In this note we analyze an anisotropic, two-dimensional bootstrap percolation model introduced by Gravner and Griffeath. We present upper and lower bounds on the finite-size effects. We discuss the similarities with the semi-oriented model introduced by Duarte.
In bootstrap percolation it is known that the critical percolation threshold tends to converge slowly to zero with increasing system size, or, inversely, the critical size diverges fast when the percolation probability goes to zero. To obtain higher-order terms (that is, sharp and sharper thresholds) for the percolation threshold in general is a hard question. In the case of two-dimensional anisotropic models, sometimes correction terms can be obtained from inversion in a relatively simple manner.
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or almost completely unaffected based on the initial seed being larger or smaller than the critical value. To analyze intervention strategies we provide the first analytic determination of the critical value for basic bootstrap percolation in random graphs when the vertex thresholds are nonuniform and provide an efficient algorithm. This result also helps solv…
In the polluted bootstrap percolation model, vertices of the cubic lattice $\mathbb{Z}^3$ are independently declared initially occupied with probability $p$ or closed with probability $q$. Under the standard (respectively, modified) bootstrap rule, a vertex becomes occupied at a subsequent step if it is not closed and it has at least $3$ occupied neighbors (respectively, an occupied neighbor in each coordinate). We study the final density of occupied vertices as $p,q\to 0$. We show that this density converges to $1$ if $q \ll p^3(\log p^{-1})^{-3}$ for both standard and modified rules. Our pri…
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 $x\in [L]^3$ already having $a_3+1$ infected neighbours, and that infected sites remain infected forever. In this paper we determine the critical length for percolation up to a constant factor in the exponent, for all triples $(a_1,a_2,a_3)$. To do so, we introduce a new algorithm called the bea…
Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white otherwise. We prove that this basic process exhibits a threshold behavior with two phase transitions when the underlying graph is a $d$-dimensional torus and identify the threshold values.
The critical activation density in graph bootstrap percolation
University of Warwick（华威大学）；LMU Munich（慕尼黑大学）；University of Canterbury（坎特伯雷大学）；University of Nebraska–Lincoln（内布拉斯加大学林肯分校）；Toronto Metropolitan University（多伦多都会大学）；University of Sheffield（谢菲尔德大学）
Bootstrap percolation has been used effectively to model phenomena as diverse as emergence of magnetism in materials, spread of infection, diffusion of software viruses in computer networks, adoption of new technologies, and emergence of collective action and cultural fads in human societies. It is defined on an (arbitrary) network of interacting agents whose state is determined by the state of their neighbors according to a threshold rule. In a typical setting, bootstrap percolation starts by random and independent "activation" of nodes with a fixed probability $p$, followed by a deterministi…
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 neighbours. The set A is said to percolate if eventually all vertices are infected. Our aim is to understand this process on the grid, [n]^d, for arbitrary functions n = n(t), d = d(t) and r = r(t), as t -> infinity. The main question is to determine the critical probability p_c([n]^d,r) at which percolation becomes likely, and to give bounds on the size of the critic…
