Related papers: Noise sensitivity in bootstrap percolation

Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| <…

We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…

An axis-parallel $d$-dimensional box is a cartesian product $I_1\times I_2\times \dots \times I_b$ where $I_i$ is a closed sub-interval of the real line. For a graph $G = (V,E)$, the $boxicity \ of \ G$, denoted by $\text{box}(G)$, is the…

We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…

We study a random graph $G$ with given degree sequence $\boldsymbol{d}$, with the aim of characterising the degree sequence of the subgraph induced on a given set $S$ of vertices. For suitable $\boldsymbol{d}$ and $S$, we show that the…

We investigate percolation in the Boolean model with convex grains in high dimension. For each dimension d, one fixes a compact, convex and symmetric set K $\subset$ R d with non empty interior. In a first setting, the Boolean model is a…

Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…

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…

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…

Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$,…

Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…

One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets…

In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the $d$-dimensional body-centered cubic (BCC) lattice $\mathbb{L}^d$ and the set of non-negative integers…

The main focus of this article concerns the strongly percolative regime of the vacant set of random interlacements on $ \mathbb{Z}^d$, with $d \ge 3$. We investigate the occurrence in a large box of an excessive fraction of sites that get…

We develop a novel method for detection of signals and reconstruction of images in the presence of random noise. The method uses results from percolation theory. We specifically address the problem of detection of multiple objects of…

We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…

By carefully analyzing the low temperature density dependence of 2D conductivity in undoped high mobility n-GaAs heterostructures, we conclude that the 2D metal-insulator transition in this system is a density inhomogeneity driven…

K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing…

In the first paper of this series [S. Torquato, J. Chem. Phys. {\bf 136}, 054106 (2012)], analytical results concerning the continuum percolation of overlapping hyperparticles in $d$-dimensional Euclidean space $\mathbb{R}^d$ were obtained,…

In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…