Related papers: The pivotal set of a Boolean function

A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions…

We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Let $S_N$ be the sum of vector-valued functions defined on a finite Markov chain. An analogue of the Bernstein--Hoeffding inequality is derived for the probability of large deviations of $S_N$ and relates the probability to the spectral gap…

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

We provide a systematic approach to deal with the following problem. Let $X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. What is a sharp upper bound on the probability that their sum is significantly larger than…

The classical Grothendieck inequality is viewed as a statement about representations of functions of two variables over discrete domains by integrals of two-fold products of functions of one variable. An analogous statement is proved,…

We obtain an asymptotic H\"older estimate for expectations of a quite general class of discrete stochastic processes. Such expectations can also be described as solutions to a dynamic programming principle or as solutions to discretized…

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this problem with rigorous guarantees. In particular, we prove the…

We calculate the joint probabilities and the correlation function in Einstein--Podolsky--Rosen type experiments with a massive vector boson in the framework of quantum field theory. We report on the strange behavior of the correlation…

The aim of this article is to provide a simple and unified way to obtain the sharp upper bounds of nodal sets of eigenfunctions for different types of eigenvalue problems on real analytic domains. The examples include biharmonic Steklov…

We study linear statistics of a class of determinantal processes which interpolate between Poisson and GUE/Ginibre statistics in dimension 1 or 2. These processes are obtained by performing an independent Bernoulli percolation on the…

Large deviation inequalities for ergodic sums is an important subject since the seminal contribution of Bernstein for independent random variables with finite variances, followed by the Chernoff method and the Hoefding result for…

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…

We study a class of rotation invariant determinantal ensembles in the complex plane; examples include the eigenvalues of Gaussian random matrices and the roots of certain families of random polynomials. The main result is a criteria for a…

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…

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…

We describe a mathematical language for determining all possible patterns of contextuality in the dependence of stochastic outputs of a system on its deterministic inputs. The central notion is that of all possible couplings for…