On K-wise Independent Distributions and Boolean Functions

Details On K-wise Independent Distributions and Boolean Functions On K-wise Independent Distributions and Boolean Functions

2012-01-16

arxiv.org/abs/1201.3261v1

Mathematics

Probability

Extended abstract. This manuscript has been on the authors' websites since 2007. It is uploaded now for ease of citation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On K-wise Independent Distributions and Boolean Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On K-wise Independent Distributions and Boolean Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On K-wise Independent Distributions and Boolean Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410219