Related papers: Bootstrap percolation is local
First-passage percolation is a random growth model defined using i.i.d. edge-weights $(t_e)$ on the nearest-neighbor edges of $\mathbb{Z}^d$. An initial infection occupies the origin and spreads along the edges, taking time $t_e$ to cross…
We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…
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…
We study a system of simple random walks on $\mathcal{T}_{d,n} = \mathcal{V}_{d,n}, \mathcal{E}_{d,n})$, the $d$-ary tree of depth $n$, known as the frog model. Initially there are Pois($\lambda$) particles at each site, independently, with…
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant…
We study the contact process in the regime of small infection rates on finite scale-free networks with stationary dynamics based on simultaneous updating of all connections of a vertex. We allow the update rates of individual vertices to…
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from…
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…
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…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on…
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we…
We establish two open problems from Kesten and Sidoravicius [8]. Particles are initially placed on $\Z^{d}$ with a given density and evolve as independent continuous-time random walks. Particles initially placed at the origin are declared…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We divide the circular boundary of a hyperbolic lattice into four equal intervals, and study the probability of a percolation crossing between an opposite pair, as a function of the bond occupation probability p. We consider the {7,3}…
We present a rough estimation -- up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs. the occupation probability -- of the critical occupation probabilities for the…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…