2012
DOI: 10.4007/annals.2012.176.1.9
|View full text |Cite
|
Sign up to set email alerts
|

A structure theorem for Boolean functions with small total influences

Abstract: 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 on properties of random graphs to the setting of arbitrary Boolean functions on general product probability spaces and improves the result of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
37
1

Year Published

2013
2013
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(38 citation statements)
references
References 18 publications
0
37
1
Order By: Relevance
“…In contrast to the results of [4,12,19], which describe the structure of families with total influence within a constant factor of the minimum, our Theorem 1.5 describes the structure of Boolean functions with total influence 'very' close to the minimum. On the other hand, the structure we obtain is very strong -namely, closeness to a genuinely extremal family.…”
Section: Related Workcontrasting
confidence: 67%
“…In contrast to the results of [4,12,19], which describe the structure of families with total influence within a constant factor of the minimum, our Theorem 1.5 describes the structure of Boolean functions with total influence 'very' close to the minimum. On the other hand, the structure we obtain is very strong -namely, closeness to a genuinely extremal family.…”
Section: Related Workcontrasting
confidence: 67%
“…The case εµ < ∆ ′ µ ′ is similar, so we shall skip some of the details. Note that 3kp > ε, by (27), and hence pn/k < (3/ε)p 2 n = (3C/ε) log n. Observe also that (30)…”
Section: The Group Z 2nmentioning
confidence: 84%
“…(2) For the case where K is bounded, µ p ( f ) is bounded away from zero and one, but log(1/ p)/ log n is bounded away from zero, there are important theorems by Friedgut [1999] and Bourgain [1999] (see below) and Hatami [2012]. These results have important applications for proving sharp threshold theorems.…”
Section: Isoperimetric Inequalities and Russo's 0-1 Lawmentioning
confidence: 99%