Related papers: Concentration on the Boolean hypercube via pathwis…
Weighting methods are essential tools for estimating causal effects in observational studies, with the goal of balancing pre-treatment covariates across treatment groups. Traditional approaches pursue this objective indirectly, for example,…
Present work contains a method to obtain Jackson and Stechkin type inequalities of approximation by integral functions of finite degree (IFFD) in some variable exponent Lebesgue space of real functions defined on $\boldsymbol{R}:=\left(…
Consensus maximisation (MaxCon), which is widely used for robust fitting in computer vision, aims to find the largest subset of data that fits the model within some tolerance level. In this paper, we outline the connection between MaxCon…
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science. For a Boolean function $f$ that takes values in {-1,1} let $r(f)$ denote its Fourier rank. For…
We prove a log-Sobolev inequality for a certain class of log-concave measures in high dimension. These are the probability measures supported on the unit cube in R^n whose density takes the form exp(-H) where the function H is assumed to be…
In this article we shall study the following elliptic system with coefficients: \begin{equation}\notag \left\{\begin{aligned} -\epsilon^2\Delta u +c(x)u=b(x)|v|^{q-1}v, &\text{ and } -\epsilon^2\Delta v +c(x)v=a(x) |u|^{p-1}u &&\text{in }…
Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
In this paper we give optimal constants in Talagrand's concentration inequalities for maxima of empirical processes associated to independent and eventually nonidentically distributed random variables. Our approach is based on the entropy…
The combination of functional limit theorems with the pathwise analysis of deterministic and stochastic differential equations has proven to be a powerful approach to the analysis of fast-slow systems. In a multivariate setting, this…
We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…
A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…
Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…
We present a new definition of influences in product spaces of continuous distributions. Our definition is geometric, and for monotone sets it is identical with the measure of the boundary with respect to uniform enlargement. We prove…
Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the…
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…
In this article we study generalization of the classical Talagrand transport-entropy inequality in which the Wasserstein distance is replaced by the entropic transportation cost. This class of inequalities has been introduced in the recent…
We provide a new exponential concentration inequality for First Passage Percolation valid for a wide class of edge times distributions. This improves and extends a result by Benjamini, Kalai and Schramm which gave a variance bound for…
In this work we use variational methods to prove results on existence and concentration of solutions to a problem in $\mathbb{R}^N$ involving the $1-$Laplacian operator. A thorough analysis on the energy functional defined in the space of…
We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…