English
Related papers

Related papers: Talagrand inequality at second order and applicati…

200 papers

We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…

Computational Complexity · Computer Science 2017-08-22 Xi Chen , Erik Waingarten , Jinyu Xie

We survey several Talagrand type inequalities and their application to influences with the tool of hypercontractivity for both discrete and continuous, and product and non-product models. The approach covers similarly by a simple…

Probability · Mathematics 2011-05-24 D. Cordero-Erausquin , M. Ledoux

We show that the natural directed analogues of the KKL theorem [KKL88] and the Eldan--Gross inequality [EG20] from the analysis of Boolean functions fail to hold. This is in contrast to several other isoperimetric inequalities on the…

Combinatorics · Mathematics 2022-10-06 Quentin Dubroff , Shivam Nadimpalli , Bhargav Narayanan

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…

Probability · Mathematics 2016-08-16 Raphaël Rossignol

It is shown that functions defined on $\{0,1,...,r-1\}^n$ satisfying certain conditions of bounded differences that guarantee sub-Gaussian tail behavior also satisfy a much stronger ``local'' sub-Gaussian property. For self-bounding and…

Probability · Mathematics 2008-01-03 Luc Devroye , Gábor Lugosi

The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the…

Combinatorics · Mathematics 2021-03-09 Peter Keevash , Noam Lifshitz , Eoin Long , Dor Minzer

The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…

Combinatorics · Mathematics 2018-06-06 Nathan Keller , Noam Lifshitz

We show that Talagrand's transport inequality is equivalent to a restricted logarithmic Sobolev inequality. This result clarifies the links between these two important functional inequalities. As an application, we give the first proof of…

Probability · Mathematics 2011-04-08 Nathael Gozlan , Cyril Roberto , Paul-Marie Samson

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O(\frac{n}{\log n})$ players can bias the outcome of any Boolean function $\{0,1\}^n \to \{0,1\}$ with respect to the uniform measure. We extend their result to…

Discrete Mathematics · Computer Science 2019-02-21 Yuval Filmus , Lianna Hambardzumyan , Hamed Hatami , Pooya Hatami , David Zuckerman

The estimate in Bullen's inequality will be extended for continuous functions using the second order modulus of smoothness. A different form of this inequality will be given in terms of the least concave majorant. Also, the composite case…

Classical Analysis and ODEs · Mathematics 2015-02-17 Ana Maria Acu , Heiner Gonska

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 show that certain statements related to the Fourier-Walsh expansion of functions with respect to a biased measure on the discrete cube can be deduced from the respective results for the uniform measure by a simple reduction. In…

Combinatorics · Mathematics 2010-11-25 Nathan Keller

In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…

Functional Analysis · Mathematics 2026-02-16 Zdeněk Mihula , Luboš Pick , Daniel Spector

In the paper we pursue the analysis from the section 5 of the Talagrand's paper "Sample boundedness of stochastic processes under increment conditions." Ann. Probab. 18, No. 1, 1-49. In particular we give the proof of some Sobolev…

Probability · Mathematics 2007-05-23 Witold Bednorz

We study the problem of estimating a monotone function $f:\{0,1\}^d\to[0,1]$ from noisy observations at uniformly random vertices of the Boolean hypercube. As a measure of complexity for the target~$f$, we use the total $L^1$-influence…

Statistics Theory · Mathematics 2026-05-20 Gérard Biau

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

Functional Analysis · Mathematics 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

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

We prove a boundedness criterion for a class of dyadic multilinear forms acting on two-dimensional functions. Their structure is more general than the one of classical multilinear Calder\'{o}n-Zygmund operators as several functions can now…

Classical Analysis and ODEs · Mathematics 2014-11-10 Vjekoslav Kovač , Christoph Thiele

We strengthen Han's Fourier entropy-influence inequality $$ H[\widehat{f}] \leq C_{1}I(f) + C_{2}\sum_{i\in [n]}I_{i}(f)\ln\frac{1}{I_{i}(f)} $$ originally proved for $\{-1,1\}$-valued Boolean functions with $C_{1}=3+2\ln 2$ and $C_{2}=1$.…

Information Theory · Computer Science 2025-12-10 Peijie Li , Guangyue Han