Noise sensitivity and Voronoi percolation

From MaRDI portal
Publication:1994516

DOI10.1214/18-EJP233zbMATH Open1402.60122arXiv1708.03054OpenAlexW3104416568MaRDI QIDQ1994516FDOQ1994516

Daniel Ahlberg, Rangel Baldasso

Publication date: 1 November 2018

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

Abstract: In this paper we study noise sensitivity and threshold phenomena for Poisson Voronoi percolation on mathbbR2. 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 box-crossing events in Voronoi percolation are noise sensitive and present a threshold phenomenon with polynomial window. We also study the effect of other kinds of perturbations, and emphasize the fact that the techniques we use apply for a broad range of models.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Noise sensitivity and Voronoi percolation

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