A structure theorem for Boolean functions with small total influences

Details A structure theorem for Boolean functions with small total influences A structure theorem for Boolean functions with small total influences

2010-08-05

arxiv.org/abs/1008.1021v3

Mathematics

Combinatorics

Some typos and minor errors are fixed. The proof of the p-biased case is presented separately. 20 pages

Scientific paper

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the structure of monotone set properties that do not exhibit sharp thresholds. Our result generalizes the core of Friedgut's seminal work [Ehud Friedgut. Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc., 12(4):1017-1054, 1999.] on properties of random graphs to the setting of arbitrary Boolean functions on general product probability spaces, and improves the result of Bourgain in his appendix to Friedgut's paper.

Affiliated with

Also associated with

No associations

Rating

A structure theorem for Boolean functions with small total influences 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 A structure theorem for Boolean functions with small total influences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A structure theorem for Boolean functions with small total influences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-438896