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 . 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
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Cites Work
- Title not available (Why is that?)
- The critical probability for random Voronoi percolation in the plane is 1/2
- Analysis of Boolean Functions
- On Russo's approximate zero-one law
- Every monotone graph property has a sharp threshold
- The critical probability of bond percolation on the square lattice equals 1/2
- Conformal invariance of Voronoi percolation
- Crossing probabilities for Voronoi percolation
- Noise sensitivity of Boolean functions and applications to percolation
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
- 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
- An approximate zero-one law
- Exclusion sensitivity of Boolean functions
- Noise sensitivity in continuum percolation
- Existence of an unbounded vacant set for subcritical continuum percolation
- Quenched Voronoi percolation
- A new computation of the critical point for the planar random-cluster model with \(q\geq1\)
Cited In (12)
- Bargmann-Fock percolation is noise sensitive
- Annealed scaling relations for Voronoi percolation
- Noise sensitivity of percolation via differential inequalities
- The sharp phase transition for level set percolation of smooth planar Gaussian fields
- Noise Sensitivity of Boolean Functions and Percolation
- The annealed spectral sample of Voronoi percolation
- Poisson-Voronoi percolation in the hyperbolic plane with small intensities
- Percolation of the excursion sets of planar symmetric shot noise fields
- Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees
- Percolation in the signal to interference ratio graph
- On the rate of convergence in quenched Voronoi percolation
- Sharp threshold for two-dimensional majority dynamics percolation
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)