An Optimal "It Ain't Over Till It's Over" Theorem

08/06/2022
by   Ronen Eldan, et al.
0

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let f be a Boolean function such that the variance of f is Ω(1) and all its individual influences are bounded by τ. We show that when restricting all but a ρ=Ω̃((log(1/τ))^-1) fraction of the coordinates, the restricted function remains nonconstant with overwhelming probability. This bound is essentially optimal, as witnessed by the tribes function TRIBES=AND_n/Clog n∘OR_Clog n. We extend it to an anti-concentration result, showing that the restricted function has nontrivial variance with probability 1-o(1). This gives a sharp version of the "it ain't over till it's over" theorem due to Mossel, O'Donnell, and Oleszkiewicz. Our proof is discrete, and avoids the use of the invariance principle. We also show two consequences of our above result: (i) As a corollary, we prove that for a uniformly random input x, the block sensitivity of f at x is Ω̃(log(1/τ)) with probability 1-o(1). This should be compared with the implication of Kahn, Kalai, and Linial's result, which implies that the average block sensitivity of f is Ω(log(1/τ)). (ii) Combining our proof with a well-known result due to O'Donnell, Saks, Schramm, and Servedio, one can also conclude that: Restricting all but a ρ=Ω̃(1/√(log (1/τ) )) fraction of the coordinates of a monotone function f, then the restricted function has decision tree complexity Ω(τ^-Θ(ρ)) with probability Ω(1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2017

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps

The well-known Sensitivity Conjecture states that for any Boolean funct...
research
09/10/2018

A log-Sobolev inequality for the multislice, with applications

Let κ∈N_+^ℓ satisfy κ_1 + ... + κ_ℓ = n and let U_κ denote the "multisli...
research
10/21/2018

Conflict complexity is lower bounded by block sensitivity

We show conflict complexity of any total boolean function, recently defi...
research
10/18/2020

Log-rank and lifting for AND-functions

Let f: {0,1}^n →{0, 1} be a boolean function, and let f_ (x, y) = f(x y...
research
11/24/2019

Revisiting Bourgain-Kalai and Fourier Entropies

The total influence of a function is a central notion in analysis of Boo...
research
12/31/2021

A phase transition for the probability of being a maximum among random vectors with general iid coordinates

Consider n iid real-valued random vectors of size k having iid coordinat...
research
11/01/2019

Kruskal-Katona for convex sets, with applications

The well-known Kruskal-Katona theorem in combinatorics says that (under ...

Please sign up or login with your details

Forgot password? Click here to reset