Related papers: Bootstrap percolation on a generalized Hamming cub…
We study a new geometric bootstrap percolation model, line percolation, on the $d$-dimensional integer grid $[n]^d$. In line percolation with infection parameter $r$, infection spreads from a subset $A\subset [n]^d$ of initially infected…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
In $r$-neighbour bootstrap percolation, vertices (sites) of a graph $G$ are infected, round-by-round, if they have $r$ neighbours already infected. Once infected, they remain infected. An initial set of infected sites is said to percolate…
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…
The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…
A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine…
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…
In modified two-neighbour bootstrap percolation in two dimensions each site of $\mathbb Z^2$ is initially independently infected with probability $p$ and on each discrete time step one additionally infects sites with at least two…
Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Frob\"ose, upper bounds are sharp to…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…
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…
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 becomes infected. The initial infection percolates if every…
We study bond percolation on the Hamming hypercube {0,1}^m around the critical probability p_c. It is known that if p=p_c(1+O(2^{-m/3})), then with high probability the largest connected component C_1 is of size Theta(2^{2m/3}) and that…
The $r$-neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with $r$ infected neighbors becomes infected. We say that an initial set of infected vertices propagates if all vertices of a…
Bootstrap percolation on a graph is a deterministic process that 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…
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…
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…
We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…
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…
We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…