Related papers: Bootstrap percolation on the Hamming torus with th…
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…
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…
We consider bond percolation on $\Z^d\times \Z^s$ where edges of $\Z^d$ are open with probability $p<p_c(\Z^d)$ and edges of $\Z^s$ are open with probability $q$, independently of all others. We obtain bounds for the critical curve in $(p,…
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…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…
We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…
We consider independent anisotropic bond percolation on $\mathbb{Z}^d\times \mathbb{Z}^s$ where edges parallel to $\mathbb{Z}^d$ are open with probability $p<p_c(\mathbb{Z}^d)$ and edges parallel to $\mathbb{Z}^s$ are open with probability…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
Following Bradonji\'c 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…
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 bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…
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…
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…
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…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…
We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
In this work we consider the two-dimensional percolation model arising from the majority dynamics process at a given time $t\in\mathbb{R}_+$. We show the emergence of a sharp threshold phenomenon for the box crossing event at the critical…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…