English
Related papers

Related papers: Quantitative relation between noise sensitivity an…

200 papers

In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…

Quantum Physics · Physics 2019-03-27 Ryuhei Mori

The Friedgut--Kalai--Naor theorem states that if a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affine…

Combinatorics · Mathematics 2016-05-03 Yuval Filmus

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

Computational Complexity · Computer Science 2026-05-27 Haakon Larsen , Tushant Mittal , Silas Richelson , Sourya Roy

We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by…

Probability · Mathematics 2022-08-16 Ronen Eldan , Dan Mikulincer , Prasad Raghavendra

The Fourier Entropy-Influence (FEI) Conjecture of Friedgut and Kalai states that ${\bf H}[f] \leq C \cdot {\bf I}[f]$ holds for every Boolean function $f$, where ${\bf H}[f]$ denotes the spectral entropy of $f$, ${\bf I}[f]$ is its total…

Computational Complexity · Computer Science 2019-01-25 Guy Shalev

We give a combinatorial proof of the result of Kahn, Kalai, and Linial, which states that every balanced boolean function on the $n$-dimensional boolean cube has a variable with influence of at least Omega(\frac{log n}{n}). The methods of…

Combinatorics · Mathematics 2007-05-23 D. Falik , A. Samorodnitsky

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer

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

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 extend, in the free probability framework, an invariance principle for multilinear homogeneous sums with low influences recently established in [E. Mossel, R. O'Donnell and K. Oleszkiewicz (2010). Noise stability of functions with low…

Probability · Mathematics 2014-03-11 Aurélien Deya , Ivan Nourdin

We present an expression for the shot noise power spectral density in quasi-one dimensional conductors electrostatically controlled by a gate electrode, that includes the effects of Coulomb interaction and of Pauli exclusion among charge…

Mesoscale and Nanoscale Physics · Physics 2015-05-13 Alessandro Betti , Gianluca Fiori , Giuseppe Iannaccone

Using Talagrand's concentration inequality on the discrete cube {0,1}^m we show that given a real-valued function Z(x)on {0,1}^m that satisfies certain monotonicity conditions one can control the deviations of Z(x) above its median by a…

Probability · Mathematics 2007-05-23 Dmitry Panchenko

The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified…

Optimization and Control · Mathematics 2014-11-27 Jean-Luc Marichal , Pierre Mathonet

In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree functions. Here we provide an alternative proof for general low-degree functions, with no constraints on the influences.…

Probability · Mathematics 2019-01-29 Yuval Filmus , Elchanan Mossel

The quantum indeterminacy caused by non-commutativity of observables at different times sets a lower bound on the voltage noise power spectrum in any conducting material. This bound is calculated explicitly in the case of semiconductors…

Mesoscale and Nanoscale Physics · Physics 2021-10-27 Kirill A. Kazakov

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

A recent discovery of Eldan and Gross states that there exists a universal $C>0$ such that for all Boolean functions $f:\{-1,1\}^n\to \{-1,1\}$, $$ \int_{\{-1,1\}^n}\sqrt{s_f(x)}d\mu(x) \ge C\text{Var}(f)\sqrt{\log…

Functional Analysis · Mathematics 2025-12-02 Paata Ivanisvili , Haonan Zhang

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

Given a sequence of Boolean functions $(f_n)_{n \geq 1}$, $f_n \colon \{ 0,1 \}^{n} \to \{ 0,1 \}$, and a sequence $(X^{(n)})_{n\geq 1} $ of continuous time $p_n $-biased random walks $ X^{(n)} = (X_t^{(n)})_{t \geq 0}$ on $ \{ 0,1 \}^{n}$,…

Probability · Mathematics 2021-01-05 Malin Palö Forsström

Harris's correlation inequality states that any two monotone functions on the Boolean hypercube are positively correlated. Talagrand \cite{Talcorr} started a line of works in search of quantitative versions of this fact by providing a lower…

Combinatorics · Mathematics 2019-12-30 Ronen Eldan
‹ Prev 1 4 5 6 7 8 10 Next ›