The FT-Mollification Method

Опубликовано 17 августа 2016, 0:33

We discuss a recent technique for dealing with k-independent families of random variables. The basic idea in showing that F is fooled by k-independence is to approximate by a smooth function F~ and note that the expectation of the Taylor polynomials are determined by k-independence. F~ can be obtained by convolving F with the Fourier transform of a compactly supported bump function. We discuss the development of this technique, leading up to the proof that limited independence fools degree 2 polynomial threshold functions.