English
Related papers

Related papers: Bargmann-Fock percolation is noise sensitive

200 papers

Proofs of sharp phase transition and noise sensitivity in percolation have been significantly simplified by the use of randomized algorithms, via the OSSS inequality (proved by O'Donnell, Saks, Schramm and Servedio (2005)) and the…

Probability · Mathematics 2022-09-22 Günter Last , Giovanni Peccati , D. Yogeshwaran

In this paper we study noise sensitivity and threshold phenomena for Poisson Voronoi percolation on $\mathbb{R}^2$. In the setting of Boolean functions, both threshold phenomena and noise sensitivity can be understood via the study of…

Probability · Mathematics 2018-11-13 Daniel Ahlberg , Rangel Baldasso

The study of noise sensitivity of Boolean functions was initiated in a seminal paper of Benjamini, Kalai and Schramm, published in 1999. While this study has revealed fascinating phenomena in the context of Bernoulli percolation, few…

Probability · Mathematics 2026-01-12 Daniel Ahlberg , Malo Hillairet , Ekaterina Toropova

We consider the problem of frequency estimation of the periodic signal multiplied by a stationary Gaussian process (Ornstein-Uhlenbeck) and observed in the presence of the white Gaussian noise. We show the consistency and asymptotic…

Statistics Theory · Mathematics 2017-10-10 O. V. Chernoyarov , Yu. A. Kutoyants

In this article, we study the problem of parameter estimation for a discrete Ornstein - Uhlenbeck model driven by Poisson fractional noise. Based on random walk approximation for the noise, we study least squares and maximum likelihood…

Statistics Theory · Mathematics 2017-12-15 Héctor Araya , Natalia Bahamonde , Tania Roa , Soledad Torres

Noise aids the encoding of continuous signals into pulse sequences by way of stochastic resonance and endows the encoding device with a preferred frequency. We study encoding by a threshold device based on the Ornstein-Uhlenbeck process,…

Biological Physics · Physics 2007-05-23 Hans E. Plesser , Theo Geisel

The Ornstein-Uhlenbeck process may be used to generate a noise signal with a finite correlation time. If a one-dimensional stochastic process is driven by such a noise source, it may be analysed by solving a Fokker-Planck equation in two…

Data Analysis, Statistics and Probability · Physics 2015-05-14 Michael Wilkinson

In this article, we study the excursions sets $\mathcal{D}\_p=f^{-1}([-p,+\infty[)$ where $f$ is a natural real-analytic planar Gaussian field called the Bargmann-Fock field. More precisely, $f$ is the centered Gaussian field on…

Probability · Mathematics 2019-05-29 Alejandro Rivera , Hugo Vanneuville

In this study, we generalize a problem of sampling a scalar Gauss Markov Process, namely, the Ornstein-Uhlenbeck (OU) process, where the samples are sent to a remote estimator and the estimator makes a causal estimate of the observed…

Information Theory · Computer Science 2022-02-14 Tasmeen Zaman Ornee , Yin Sun

One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are…

Probability · Mathematics 2007-05-23 Oded Schramm , Jeffrey E. Steif

We study first-passage percolation on $\mathbb Z ^2$ with independent and identically distributed weights, whose common distribution is uniform on $\{a,b\}$ with $0<a<b<\infty $. Following Ahlberg and De la Riva, we consider the passage…

Probability · Mathematics 2025-05-07 Barbara Dembin , Dor Elboim

It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction…

Probability · Mathematics 2008-11-26 Itai Benjamini , Gil Kalai , Oded Schramm

The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm [Inst. Hautes \'{E}tudes Sci. Publ. Math. 90 (1999) 5-43],…

Probability · Mathematics 2015-12-23 Eyal Lubetzky , Jeffrey E. Steif

The asymptotic behavior of a nonlinear oscillator subject to a multiplicative Ornstein-Uhlenbeck noise is investigated. When the dynamics is expressed in terms of energy-angle coordinates, it is observed that the angle is a fast variable as…

Statistical Mechanics · Physics 2014-12-19 Kirone Mallick , Philippe Marcq

Inferring dynamical models from data continues to be a significant challenge in computational biology, especially given the stochastic nature of many biological processes. We explore a common scenario in omics, where statistically…

Machine Learning · Computer Science 2025-07-31 Suryanarayana Maddu , Victor Chardès , Michael. J. Shelley

We prove that the connectivity of the level sets of a wide class of smooth centred planar Gaussian fields exhibits a phase transition at the zero level that is analogous to the phase transition in Bernoulli percolation. In addition to…

Probability · Mathematics 2019-06-04 Stephen Muirhead , Hugo Vanneuville

The paper considers the problem of estimating the parameters in a continuous time regression model with a non-Gaussian noise of pulse type. The noise is specified by the Ornstein-Uhlenbeck process driven by the mixture of a Brownian motion…

Statistics Theory · Mathematics 2019-09-17 Evgeny Pchelintsev

We consider equations of nonlinear transport on the circle with regular self interactions appearing in aggregation models and deterministic mean field dynamics. We introduce a random perturbation of such systems through a stochastic…

Probability · Mathematics 2026-01-07 Max-K. von Renesse , Feng-Yu Wang , Alexander Weiß

Recently, many results have been established drawing a parallel between Bernoulli percolation and models given by levels of smooth Gaussian fields with unbounded, strongly decaying correlation. In a previous work with D. Gayet , we started…

Probability · Mathematics 2022-04-12 Vivek Dewan

We introduce the notion of classical fractional query algorithms, which generalize decision trees in the average-case setting, and can potentially perform better than them. We show that the limiting run-time complexity of a natural class of…

Computational Complexity · Computer Science 2022-01-26 Renan Gross
‹ Prev 1 2 3 10 Next ›