English
Related papers

Related papers: Invariance principle on the slice

200 papers

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

In this paper we study functions with low influences on product probability spaces. The analysis of boolean functions with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions…

Probability · Mathematics 2007-05-23 Elchanan Mossel , Ryan O'Donnell , Krzysztof Oleszkiewicz

Given an alphabet size $m\in\mathbb{N}$ thought of as a constant, and $\vec{k} = (k_1,\ldots,k_m)$ whose entries sum of up $n$, the $\vec{k}$-multi-slice is the set of vectors $x\in [m]^n$ in which each symbol $i\in [m]$ appears precisely…

Computational Complexity · Computer Science 2025-07-28 Mark Braverman , Subhash Khot , Noam Lifshitz , Dor Minzer

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein

This paper considers the Fourier transform over the slice of the Boolean hypercube. We prove a relationship between the Fourier coefficients of a function over the slice, and the Fourier coefficients of its restrictions. As an application,…

Combinatorics · Mathematics 2021-11-08 Shravas Rao

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

The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem…

Combinatorics · Mathematics 2020-04-01 Yuval Filmus

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

We present an orthogonal basis for functions over a slice of the Boolean hypercube. Our basis is also an orthogonal basis of eigenvectors for the Johnson and Kneser graphs. As an application of our basis, we streamline Wimmer's proof of…

Combinatorics · Mathematics 2022-03-15 Yuval Filmus

We generalize Lindeberg's proof of the central limit theorem to an invariance principle for arbitrary smooth functions of independent and weakly dependent random variables. The result is applied to get a similar theorem for smooth functions…

Probability · Mathematics 2007-05-23 Sourav Chatterjee

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

Computational Complexity · Computer Science 2022-11-30 Farzan Byramji

We prove the Lukacs-Olkin-Rubin theorem without invariance of the distribution of the "quotient", which was the key assumption in the original proof of [Olkin--Rubin, Ann. Math. Stat. 33 (1962), 1272--1280]. Instead we assume existence of…

Probability · Mathematics 2016-09-21 Bartosz Kołodziejek

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k} = \{ (x_1,\ldots,x_n) \in \{0,1\} : \sum_{i=1}^n x_i = k \}$ is a junta, assuming that $k,n-k$ are large enough. This generalizes a classical result of Nisan and…

Combinatorics · Mathematics 2018-01-23 Yuval Filmus , Ferdinand Ihringer

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

Optimization and Control · Mathematics 2020-09-04 Daniel Reem , Simeon Reich , Alvaro De Pierro

The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube. Unlike the…

Computational Complexity · Computer Science 2012-11-07 Anindya De , Elchanan Mossel , Joe Neeman

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{…

Probability · Mathematics 2020-03-13 Ronen Eldan , Renan Gross

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

This paper is devoted to establish an invariance principle where the limit process is a multifractional Gaussian process with a multifractional function which takes its values in $(1/2,1)$. Some properties, such as regularity and local…

Probability · Mathematics 2009-09-29 Serge Cohen , Renaud Marty

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
‹ Prev 1 2 3 10 Next ›