Related papers: A Harris-Kesten theorem for confetti percolation

In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.

We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erd\H{o}s-R\'enyi random graphs. Let $p_{\text{ppl}}$ and $p_{\text{puz}}$ denote the probability that an edge exists in the…

We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie lattice with five different probabilities, a problem that does not appear at first to fall into any known solvable class. Although our…

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…

We prove that the Poisson Boolean model, also known as the Gilbert disc model, is noise sensitive at criticality. This is the first such result for a Continuum Percolation model, and the first for which the critical probability p_c \ne 1/2.…

In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex becomes active if at least…

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.…

Ever since J.M. Hammersley showed the existence of phase-transitions regarding independent bond percolation on general $d \geq 2$ dimensional integer-lattices in the late 50's, the continuity (or discontinuity) of which is perhaps the most…

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times \{1, \cdots, k\},$ namely the slab $\mathbb{S}_k$ of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $p_c(\mathbb{S}_k)$)…

Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…

Consider critical site percolation on a "nice" planar lattice: each vertex is occupied with probability $p = p_c$, and vacant with probability $1 - p_c$. Now, suppose that additional vacancies ("holes", or "impurities") are created,…

A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…

We calculate the distribution of the size of the percolating cluster on a tree in the subcritical, critical and supercritical phase. We do this by exploiting a mapping between continuum trees and Brownian excursions, and arrive at a…

In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson-Voronoi tessellation in the $d$-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of…

This article presents a method for finding the critical probability $p_c$ for the Bernoulli bond percolation on graphs with the so-called tree-like structure. Such a graph can be decomposed into a tree of pieces, each of which has finitely…

The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…

We consider Bernoulli (bond) percolation with parameter $p$ on the Cayley tree of order $k$. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard…