English
Related papers

Related papers: The pivotal set of a Boolean function

200 papers

One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…

Logic · Mathematics 2020-11-30 Andrew DeLapo

Let $b(x)$ be the probability that a sum of independent Bernoulli random variables with parameters $p_1, p_2, p_3, \ldots \in [0,1)$ equals $x$, where $\lambda := p_1 + p_2 + p_3 + \cdots$ is finite. We prove two inequalities for the…

Statistics Theory · Mathematics 2020-07-24 Lutz Duembgen , Jon A. Wellner

Talagrand's inequality for independent Bernoulli random variables is extended to many interacting particle systems (IPS). The main assumption is that the IPS satisfies a log-Sobolev inequality. In this context it is also shown that a…

Probability · Mathematics 2014-05-23 Florian Völlering

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Combinatorics · Mathematics 2007-05-23 Constanza Riera , Lars Eirik Danielsen , Matthew G. Parker

In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function…

Optimization and Control · Mathematics 2025-02-27 Arjun Ramachandra , Karthik Natarajan

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

We establish bounds for the covariance of a large class of functions of infinite variance stable random variables, including unbounded functions such as the power function and the logarithm. These bounds involve measures of dependence…

Statistics Theory · Mathematics 2011-11-10 Vladas Pipiras , Murad S. Taqqu , Patrice Abry

We analyze the assumptions that are made in the proofs of Bell-type inequalities for the results of Einstein-Podolsky-Rosen type of experiments. We find that the introduction of time-like random variables permits the construction of a…

Quantum Physics · Physics 2007-05-23 Karl Hess , Walter Philipp

We introduce the boolean convolution for probability measures on the unit circle. Roughly speaking, it describes the distribution of the product of two boolean independent unitary random variables. We find an analogue of the characteristic…

Functional Analysis · Mathematics 2009-06-13 Uwe Franz

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Rings and Algebras · Mathematics 2014-06-10 Jean-Luc Marichal , Bruno Teheux

The main purpose of this paper is to establish a noncommutative analogue of the Efron--Stein inequality, which bounds the variance of a general function of some independent random variables. Moreover, we state an operator version including…

Functional Analysis · Mathematics 2021-07-23 Ali Talebi , Mohammad Sal Moslehian

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

Beckner's inequality is a family of inequalities that interpolates the two fundamental functional inequalities, the logarithmic Sobolev and Poincar\'e's inequalities. It is parametrized by exponent $p\in (1,2]$ and it implies the…

Probability · Mathematics 2026-04-22 Yuu Hariya

On any denumerable product of probability spaces, we construct a Malliavin gradient and then a divergence and a number operator. This yields a Dirichlet structure which can be shown to approach the usual structures for Poisson and Brownian…

Probability · Mathematics 2018-07-30 Laurent Decreusefond , Hélène Halconruy

We present a probabilistic interpretation of several functional isoperimetric inequalities within the class of $p$-concave functions, building on random models for such functions introduced by P. Pivovarov and J. Rebollo-Bueno. First, we…

Functional Analysis · Mathematics 2026-04-15 Francisco Marín Sola

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

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

We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…

Probability · Mathematics 2016-12-30 Tetsuya Hattori

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin

Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…

Probability · Mathematics 2011-06-28 Marc Arnaudon , Clément Dombry , Anthony Phan , Le Yang
‹ Prev 1 2 3 10 Next ›