Related papers: Noise sensitivity in bootstrap percolation
We prove that for Bernoulli bond percolation on $\mathbb{Z}^d$, $d\geq 2$ the percolation density is an analytic function of the parameter in the supercritical interval $(p_c,1]$. This answers a question of Kesten from 1981.
We prove that for Bernoulli percolation on $\mathbb{Z}^d$, $d\geq 2$, the percolation density is an analytic function of the parameter in the supercritical interval. For this we introduce some techniques that have further implications. In…
For any integer $r\geqslant0$, the $r$-neighbor bootstrap percolation on a graph is an activation process of the vertices. The process starts with some initially activated vertices and then, in each round, any inactive vertex with at least…
Consider a Boolean model $\Sigma$ in $\R^d$. The centers are given by a homogeneous Poisson point process with intensity $\lambda$ and the radii of distinct balls are i.i.d.\ with common distribution $\nu$. The critical covered volume is…
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…
We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…
We study the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set $[n]$ and degree sequence $\mathbf{d}=(d_i)_{i=1}^n$. In a previous work, the asymptotic cover time was obtained under a number of…
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…
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…
We study a model of an i.i.d.~random environment in general dimensions $d\ge 2$, where each site is equipped with one of two environments. The model comes with a parameter $p$ which governs the frequency of the first environment, and for…
One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
In 2-neighborhood bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: infected vertices of G remain infected forever and in consecutive rounds healthy vertices with at least 2 already…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
We consider the discrete Boolean model of percolation on graphs satisfying a doubling metric condition. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the…
We provide asymptotically sharp bounds for the Gaussian surface area and the Gaussian noise sensitivity of polynomial threshold functions. In particular we show that if $f$ is a degree-$d$ polynomial threshold function, then its Gaussian…
In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…
We establish the sharpness of the phase transition for a wide class of Gaussian percolation models, on $\mathbb{Z}^d$ or $\mathbb{R}^d$, $d \ge 2$, with correlations decaying at least algebraically with exponent $\alpha > 0$, including the…