Related papers: A note on the Harris-Kesten Theorem
We give a short proof of the fundamental result that the critical probability for bond percolation in the planar square lattice is equal to 1/2. The lower bound was proved by Harris, who showed in 1960 that percolation does not occur at…
Recently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square…
We study percolation in the following random environment: let $Z$ be a Poisson process of constant intensity in the plane, and form the Voronoi tessellation of the plane with respect to $Z$. Colour each Voronoi cell black with probability…
Percolation properties of the dead leaves model, also known as confetti percolation, are considered. More precisely, we prove that the critical probability for confetti percolation with square-shaped leaves is 1/2. This result is related to…
We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the…
Kesten showed the exponential decay of percolation probability in the subcritical phase for the two-dimensional percolation model. This result implies his celebrated computation that $p_c=0.5$ for bond percolation in the square lattice, and…
We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster tends to $1/2$ as the intensity of…
Position $n$ points uniformly at random in the unit square $S$, and consider the Voronoi tessellation of $S$ corresponding to the set $\eta$ of points. Toss a fair coin for each cell in the tessellation to determine whether to colour the…
Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…
In 1991 Aizenman and Grimmett claimed that any `essential enhancement' of site or bond percolation on a lattice lowers the critical probability, an important result with many implications, such as strict inequalities between critical…
In the confetti percolation model, or two-coloured dead leaves model, radius one disks arrive on the plane according to a space-time Poisson process. Each disk is coloured black with probability $p$ and white with probability $1-p$. In this…
We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…
We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-\rho$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$…
We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…
We give a self-contained and detailed presentation of Kesten's results that allow to relate critical and near-critical percolation on the triangular lattice. They constitute an important step in the derivation of the exponents describing…
The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…
We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…
We show that crossing probabilities in 2D critical site percolation on the triangular lattice in a piecewise analytic Jordan domain converge with power law rate in the mesh size to their limit given by the Cardy-Smirnov formula. We use this…