Anti-concentration for polynomials of Rademacher random variables and applications in complexity theory

We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates. We discuss applications in two different areas. In complexity theory, we prove near optimal lower bounds for computing the Parity, addressing a challenge in complexity theory posed by Razborov and Viola, and also address a problem concerning OR functions. In random graph theory, we derive a general anti-concentration result on the number of copies of a fixed graph in a random graph.

[1]  P. Erdös.  On a lemma of Littlewood and Offord , 1945 .

[2]  J. Littlewood,et al.  On the Number of Real Roots of a Random Algebraic Equation , 1938 .

[3]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[4]  Kevin P. Costello.  Bilinear and quadratic variants on the Littlewood-Offord problem , 2009 .

[5]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[6]  Daniel M. Kane,et al.  The correct exponent for the Gotsman–Linial Conjecture , 2012, 2013 IEEE Conference on Computational Complexity.

[7]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[8]  Ryan Williams,et al.  Faster all-pairs shortest paths via circuit complexity , 2013, STOC.

[9]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[10]  James Aspnes,et al.  The expressive power of voting polynomials , 1991, STOC '91.

[11]  Johan Håstad,et al.  Randomly supported independence and resistance , 2009, STOC '09.

[12]  Prahladh Harsha,et al.  Bounding the Sensitivity of Polynomial Threshold Functions , 2014, Theory Comput..

[13]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[14]  A. Carbery,et al.  Distributional and L-q norm inequalities for polynomials over convex bodies in R-n , 2001 .

[15]  Richard Ryan Williams.  The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk) , 2014, FSTTCS.

[16]  Kevin P. Costello,et al.  Random symmetric matrices are almost surely nonsingular , 2005, math/0505156.

[17]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[18]  Huacheng Yu,et al.  More Applications of the Polynomial Method to Algorithm Design , 2015, SODA.

[19]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[20]  Daniel M. Kane.  A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[21]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[22]  V. Vu,et al.  Small Ball Probability, Inverse Theorems, and Applications , 2012, 1301.0019.

[23]  Emanuele Viola,et al.  Real Advantage , 2013, TOCT.

[24]  Scott Aaronson.  The Polynomial Method in Quantum and Classical Computing , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Ryan O'Donnell,et al.  On the Fourier tails of bounded functions over the discrete cube , 2006, STOC '06.

[26]  T. Sanders,et al.  Analysis of Boolean Functions , 2012, ArXiv.

[27]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[28]  Rocco A. Servedio,et al.  A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.