On the rate of convergence in quenched Voronoi percolation

DOI10.1214/21-EJP712zbMATH Open1491.60168arXiv2103.01870OpenAlexW4205159201MaRDI QIDQ2076609FDOQ2076609

Daniel de la Riva, Simon Griffiths, Daniel Ahlberg

Publication date: 22 February 2022

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: 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 cell red or blue. Let $H_S$ denote the event that there exists a red horizontal crossing of $S$ in the resulting colouring. In 1999, Benjamini, Kalai and Schramm conjectured that knowing the tessellation, but not the colouring, asymptotically gives no information as to whether the event $H_S$ will occur or not. More precisely, since $H_S$ occurs with probability $1/2$, by symmetry, they conjectured that the conditional probabilities $mathbbP(H_S|eta)$ converge in probability to 1/2, as $noinfty$. This conjecture was settled in 2016 by Ahlberg, Griffiths, Morris and Tassion. In this paper we derive a stronger bound on the rate at which $mathbbP(H_S|eta)$ approaches its mean. As a consequence we strengthen the convergence in probability to almost sure convergence.

Full work available at URL: https://arxiv.org/abs/2103.01870

zbMATH Keywords

concentrationnoise sensitivityVoronoi percolation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Title not available (Why is that?)
• Percolation
• Moment estimates derived from Poincaré and logarithmic Sobolev inequalities
• The critical probability for random Voronoi percolation in the plane is 1/2
• Analysis of Boolean Functions
• Crossing probabilities for Voronoi percolation
• Noise sensitivity of Boolean functions and applications to percolation
• Noise Sensitivity of Boolean Functions and Percolation
• The Fourier spectrum of critical percolation
• Learning Monotone Decision Trees in Polynomial Time
• Quantitative noise sensitivity and exceptional times for percolation
• Noise sensitivity in continuum percolation
• Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\)
• Quenched Voronoi percolation
• Lectures on the Poisson Process
• Annealed scaling relations for Voronoi percolation
• Noise sensitivity and Voronoi percolation
• The annealed spectral sample of Voronoi percolation
• Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees

Cited In (1)

• Noise sensitivity and stability of deep neural networks for binary classification

This page was built for publication: On the rate of convergence in quenched Voronoi percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076609)