# The critical probability for random Voronoi percolation in the plane is 1/2

@article{Bollobs2004TheCP, title={The critical probability for random Voronoi percolation in the plane is 1/2}, author={B{\'e}la Bollob{\'a}s and Oliver Riordan}, journal={Probability Theory and Related Fields}, year={2004}, volume={136}, pages={417-468} }

We study percolation in the following random environment: let Z be a Poisson process of constant intensity on ℝ2, and form the Voronoi tessellation of ℝ2 with respect to Z. Colour each Voronoi cell black with probability p, independently of the other cells. We show that the critical probability is 1/2. More precisely, if p>1/2 then the union of the black cells contains an infinite component with probability 1, while if p<1/2 then the distribution of the size of the component of black cells…

## 121 Citations

### The annealed spectral sample of Voronoi percolation

- Mathematics
- 2019

In this paper, we study the annealed spectral sample of Voronoi percolation, which is a continuous and finite point process in $\mathbb{R}^2$ whose definition is mostly inspired by the spectral…

### On the rate of convergence in quenched Voronoi percolation

- MathematicsElectronic Journal of Probability
- 2021

Position n points uniformly at random in the unit square S, and consider the Voronoi tessellation of S corresponding to the set η of points. Toss a fair coin for each cell in the tessellation to…

### Submitted to the Annals of Probability THE ANNEALED SPECTRAL SAMPLE OF VORONOI PERCOLATION By

- Mathematics
- 2020

In this paper, we introduce and study the annealed spectral sample of Voronoi percolation, which is a continuous and finite point process in R whose definition is mostly inspired by the spectral…

### Continuum line-of-sight percolation on Poisson–Voronoi tessellations

- MathematicsAdvances in Applied Probability
- 2021

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

### Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2009

The results rule out the conjecture by Hsu and Huang that the bond thresholds are 2/3 and 1/3, respectively, but support the conjecture of Wierman that, for fully triangulated lattices other than the regular triangular lattice, the bond threshold is less than 2 sin pi/18 approximately 0.3473.

### The critical probability for confetti percolation equals 1/2

- MathematicsRandom Struct. Algorithms
- 2017

It is shown that the critical probability for confetti percolation equals 1/2, which answers a question of Benjamini and Schramm and builds on earlier work by Hirsch and makes use of an adaptation of a sharp thresholds result of Bourgain.

### The critical probability for confetti percolation equals $1/2$

- Mathematics
- 2015

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 back with probability p and…

### Criticality and Covered Area Fraction in Confetti and Voronoi Percolation

- MathematicsJournal of Statistical Physics
- 2021

Using the randomized algorithm method developed by Duminil-Copin et al. (Probab Theory Relat Fields 173(1–2):479–90, 2019), we exhibit sharp phase transition for the confetti percolation model. This…

### Sharpness of the phase transition for continuum percolation in R^2

- Mathematics
- 2016

We study the phase transition of random radii Poisson Boolean percolation: Around each point of a planar Poisson point process, we draw a disc of random radius, independently for each point. The…

### Planarity and locality in percolation theory

- Mathematics
- 2014

This thesis is part of the mathematical study of percolation theory, which includes a family of models with a phase transition. Major advances in the 2000s, including the invention of SLE and the…

## References

SHOWING 1-10 OF 32 REFERENCES

### Continuum percolation with steps in the square or the disc

- MathematicsRandom Struct. Algorithms
- 2005

The proof is in two parts: first a rigorous reduction of the problem to a finite problem, and then the problem is solved using Monte-Carlo methods and it is proved that, with 99.99% confidence, the critical area lies between 4.508 and 4.515.

### Conformal Invariance of Voronoi Percolation

- Mathematics
- 1998

Abstract:
It is proved that in the Voronoi model for percolation in dimension 2 and 3, the crossing probabilities are asymptotically invariant under conformal change of metric.
To define Voronoi…

### Percolation ?

- Mathematics
- 1982

572 NOTICES OF THE AMS VOLUME 53, NUMBER 5 Percolation is a simple probabilistic model which exhibits a phase transition (as we explain below). The simplest version takes place on Z2, which we view…

### A lower bound for the critical probability in a certain percolation process

- MathematicsMathematical Proceedings of the Cambridge Philosophical Society
- 1960

Consider a lattice L in the Cartesian plane consisting of all points (x, y) such that either x or y is an integer. Points with integer coordinates (positive, negative, or zero) are called vertices…

### Domination by product measures

- Mathematics
- 1997

We consider families of(0,1)-valued random variables indexed by the vertices of countable graphs with bounded degree. First we show that if these random variables satisfy the property that…

### Percolation in Voronoi tilings

- Computer ScienceRandom Struct. Algorithms
- 2005

It is proved that for large d, 2−d(9d log d)−1 ≤ pc(d) ≤ C2−d$\sqrt{d}$ log d, and the existence of a phase transition as the proportion p of open cells is varied is proved.

### Sharp thresholds and percolation in the plane

- MathematicsRandom Struct. Algorithms
- 2006

The aim of this paper is to show that the same techniques can be applied to many other planar percolation models, both to obtain short proofs of known results, and to prove new ones.

### Density and uniqueness in percolation

- Mathematics
- 1989

Two results on site percolation on thed-dimensional lattice,d≧1 arbitrary, are presented. In the first theorem, we show that for stationary underlying probability measures, each infinite cluster has…

### A Short Proof of the Harris–Kesten Theorem

- Mathematics
- 2004

We give a short proof of the fundamental result that the critical probability for bond percolation in the planar square lattice Z2 is equal to 1/2. The lower bound was proved by Harris, who showed in…