Many fundamental and important questions from statistical physics lead to beautiful
problems in extremal and probabilistic combinatorics. One particular example of this …

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 …

The k‐parameter bootstrap percolation on a graph is a model of an interacting particle
system, which can also be viewed as a variant of a cellular automaton growth process with …

In the bootstrap percolation on the n-dimensional hypercube, in the initial position each of
the 2 n sites is occupied with probability p and empty with probability 1− p, independently of …

The rapid spread of infectious diseases and online rumors share similarities in terms of their
speed, scale, and patterns of contagion. Although these two phenomena have historically …

We study the epidemic source detection problem in contact tracing networks modeled as a
graph-constrained maximum likelihood estimation problem using the susceptible-infected …

Bootstrap Percolation on Infinite Trees and Non-Amenable Groups Page 1 Combinatorics,
Probability and Computing (2006) 15, 715–730. c 2006 Cambridge University Press doi:10.1017/S0963548306007619 …

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 …

In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A⊂ V (G)
is chosen independently at random, with density p, and new vertices are subsequently …

We consider a classic model known as bootstrap percolation on the n*n square grid. To
each vertex of the grid we assign an initial state, infected or healthy, and then in consecutive …