2018
DOI: 10.1214/18-ejp233
|View full text |Cite
|
Sign up to set email alerts
|

Noise sensitivity and Voronoi percolation

Abstract: In this paper we study noise sensitivity and threshold phenomena for Poisson Voronoi percolation on R 2 . In the setting of Boolean functions, both threshold phenomena and noise sensitivity can be understood via the study of randomized algorithms. Together with a simple discretization argument, such techniques apply also to the continuum setting. Via the study of a suitable algorithm we show that boxcrossing events in Voronoi percolation are noise sensitive and present a threshold phenomenon with polynomial wi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(33 citation statements)
references
References 25 publications
0
33
0
Order By: Relevance
“…In the above argument the OSSS inequality was applied to crossing events of squares, whereas the control of the revealments δ i was achieved by analysing one-arm events; this is roughly how we shall apply the OSSS inequality (see also [AB18] where this argument is carried out for planar Voronoi percolation). In [DCRT19a, DCRT19b, DCRT18] the OSSS inequality is instead applied to one-arm events directly, a powerful approach that ultimately yields the phase transition in all dimensions for a wide class of models.…”
Section: Overview Of Our Methods and Outline Of The Proofmentioning
confidence: 99%
“…In the above argument the OSSS inequality was applied to crossing events of squares, whereas the control of the revealments δ i was achieved by analysing one-arm events; this is roughly how we shall apply the OSSS inequality (see also [AB18] where this argument is carried out for planar Voronoi percolation). In [DCRT19a, DCRT19b, DCRT18] the OSSS inequality is instead applied to one-arm events directly, a powerful approach that ultimately yields the phase transition in all dimensions for a wide class of models.…”
Section: Overview Of Our Methods and Outline Of The Proofmentioning
confidence: 99%
“…Such bounds were first obtained by Schramm and Steif [14], then by Garban, Pete and Schramm [9] and more recently Tassion and Vanneuville [16]. In another direction, the study of noise sensitivity was extended to percolation models in the continuum by Ahlberg, Broman, Griffiths and Morris [2], Ahlberg and Baldasso [1], and most recently Last, Peccati and Yogeshwaran [11]. One of the conjectures from [5] concerned such a continuum model, known as Voronoi percolation, and that conjecture has motivated the current work.…”
Section: Introductionmentioning
confidence: 94%
“…To prove (4.3) we apply the OSSS inequality to the random variables (Z i ) i∈Λ defined in (4.1) and the following algorithm (see [MV20], and also [AB18,BKS99,SS10]). First fix a random horizontal line L = {y = U } where U (R) is an independent [0, R]-uniform random variable.…”
Section: Proposition 44 (Russo-type Inequality)mentioning
confidence: 99%