English
Related papers

Related papers: Noise Stability and Correlation with Half Spaces

200 papers

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

Probability · Mathematics 2019-06-11 Vilhelm Agdur

We study the Gaussian noise stability of subsets A of Euclidean space satisfying A=-A. It is shown that an interval centered at the origin, or its complement, maximizes noise stability for small correlation, among symmetric subsets of the…

Probability · Mathematics 2016-09-05 Steven Heilman

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

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

Using the calculus of variations, we prove the following structure theorem for noise stable partitions: a partition of $n$-dimensional Euclidean space into $m$ disjoint sets of fixed Gaussian volumes that maximize their noise stability must…

Probability · Mathematics 2023-06-22 Steven Heilman , Alex Tarter

A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…

Discrete Mathematics · Computer Science 2014-01-14 Deeparnab Chakrabarty , C. Seshadhri

Statistic dynamics of financial systems is investigated, basing on a model of randomly coupled equation system driven by stochastic Langevin force. It is found that in stable regime the noise power spectrum of the system is of 1/f^alpha…

Disordered Systems and Neural Networks · Physics 2008-12-02 Kestutis Staliunas

We investigate the stabilization of unstable multidimensional partially observed single-sensor and multi-sensor linear systems driven by unbounded noise and controlled over discrete noiseless channels under fixed-rate information…

Optimization and Control · Mathematics 2012-09-21 Andrew P. Johnston , Serdar Yüksel

A natural problem in high-dimensional inference is to decide if a classifier $f:\mathbb{R}^n \rightarrow \{-1,1\}$ depends on a small number of linear directions of its input data. Call a function $g: \mathbb{R}^n \rightarrow \{-1,1\}$, a…

Computational Complexity · Computer Science 2021-01-14 Anindya De , Elchanan Mossel , Joe Neeman

A function $f\in \mathcal{A}_1$ is said to be stable with respect to $g\in \mathcal{A}_1 $ if \begin{align*} \frac{s_n(f(z))}{f(z)} \prec \frac{1}{g(z)}, \qquad z\in\mathbb{D}, \end{align*} holds for all $n \in \mathbb{N}$ where…

Complex Variables · Mathematics 2019-10-15 Koneri Chandrasekran , Devasir John Prabhakaran , Priyanka Sangal

We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \in \mathbb{Z}^+$ and $\varepsilon > 0$, it is NP-hard…

Computational Complexity · Computer Science 2017-07-07 Arnab Bhattacharyya , Suprovat Ghoshal , Rishi Saket

We give a $\mathrm{poly}(\log n, 1/\epsilon)$-query adaptive algorithm for testing whether an unknown Boolean function $f: \{-1,1\}^n \to \{-1,1\}$, which is promised to be a halfspace, is monotone versus $\epsilon$-far from monotone. Since…

Computational Complexity · Computer Science 2017-06-20 Xi Chen , Rocco A. Servedio , Li-Yang Tan , Erik Waingarten

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find an optimizer of noise stability among all possible partitions…

Probability · Mathematics 2017-02-17 Anindya De , Elchanan Mossel , Joe Neeman

Keller and Kindler recently established a quantitative version of the famous Benjamini~--Kalai--Schramm Theorem on noise sensitivity of Boolean functions. The result was extended to the continuous Gaussian setting by Keller, Mossel and Sen…

Probability · Mathematics 2017-02-03 Raphaël Bouyrie

This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…

Probability · Mathematics 2026-03-26 Yiming Chen , Guozheng Dai

In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, \( f_n \colon \{ -1,1 \}^n \to \{ -1,1 \} \) were introduced. We continue their study of how these definitions relate to…

Probability · Mathematics 2020-05-28 Malin Palö Forsström

We demonstrate that waves in distinct layers of a neuronal network can become phase-locked by common spatiotemporal noise. This phenomenon is studied for stationary bumps, traveling waves, and breathers. A weak noise expansion is used to…

Pattern Formation and Solitons · Physics 2015-04-22 Zachary P. Kilpatrick

We consider the influence of correlated noise on the stability of synchronisation of oscillators on a general network using the Kuramoto model for coupled phases $\theta_i$. Near the fixed point $\theta_i \approx \theta_j \ \forall i,j$ the…

Statistical Mechanics · Physics 2013-04-29 Mathew Zuparic , Alexander C. Kalloniatis

We derive relations between standard order parameter correlations and the noise correlations in time of flight images, which are valid for systems with long range order as well as low dimensional systems with algebraic decay of…

Other Condensed Matter · Physics 2011-05-31 L. Mathey , A. Vishwanath , E. Altman

Let $T_{\epsilon}$ be the noise operator acting on Boolean functions $f:\{0, 1\}^n\to \{0, 1\}$, where $\epsilon\in[0, 1/2]$ is the noise parameter. Given $\alpha>1$ and fixed mean $\mathbb{E} f$, which Boolean function $f$ has the largest…

Probability · Mathematics 2021-01-27 Jiange Li , Muriel Medard