pith. sign in

arxiv: 1201.3261 · v1 · pith:WPD32JBCnew · submitted 2012-01-16 · 🧮 math.PR · math.CO

On K-wise Independent Distributions and Boolean Functions

classification 🧮 math.PR math.CO
keywords independentbitsbooleanfunctionk-wisewhenbehaviourcompletely
0
0 comments X
read the original abstract

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about the behaviour of the function when the input bits are not completely independent, but only k-wise independent, i.e. every subset of k bits is independent? more precisely, how high should k be so that any k-wise independent distribution "fools" the function, i.e. causes it to behave nearly the same as when the bits are completely independent? We analyze several well known Boolean functions (including AND, Majority, Tribes and Percolation among others), some of which turn out to have surprising properties. In some of our results we use tools from the theory of the classical moment problem, seemingly for the first time in this subject, to shed light on these questions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Low-Degree Fourier Threshold for Random Boolean Functions

    math.PR 2026-04 unverdicted novelty 8.0

    For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.