Hypercontractivity for global functions and sharp thresholds

The classical hypercontractive inequality for the noise operator on the discrete cube plays a crucial role in many of the fundamental results in the Analysis of Boolean functions, such as the KKL (Kahn-Kalai-Linial) theorem, Friedgut's junta theorem and the invariance principle of Mossel, O'Donnell and Oleszkiewicz. In these results the cube is equipped with the uniform ($1/2$-biased) measure, but it is desirable, particularly for applications to the theory of sharp thresholds, to also obtain such results for general $p$-biased measures. However, simple examples show that when $p$ is small there is no hypercontractive inequality that is strong enough for such applications. In this paper, we establish an effective hypercontractivity inequality for general $p$ that applies to `global functions', i.e. functions that are not significantly affected by a restriction of a small set of coordinates. This class of functions appears naturally, e.g. in Bourgain's sharp threshold theorem, which states that such functions exhibit a sharp threshold. We demonstrate the power of our tool by strengthening Bourgain's theorem, thereby making progress on a conjecture of Kahn and Kalai. An additional application of our hypercontractivity theorem, is a $p$-biased analog of the seminal invariance principle of Mossel, O'Donnell, and Oleszkiewicz. In a companion paper, we give applications to the solution of two open problems in Extremal Combinatorics.

[1]  Nathan Keller,et al.  Approximation of biased Boolean functions of small total influence by DNFs , 2017, ArXiv.

[2]  M. Schacht,et al.  A sharp threshold for van der Waerden's theorem in random subsets , 2016 .

[3]  A. Bonami Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .

[4]  Daniel Ahlberg,et al.  Noise sensitivity in continuum percolation , 2011, 1108.0310.

[5]  Santhosh Kumar,et al.  Reed–Muller Codes Achieve Capacity on Erasure Channels , 2015, IEEE Transactions on Information Theory.

[6]  Elchanan Mossel,et al.  Robust Optimality of Gaussian Noise Stability , 2012, 1210.4126.

[7]  S. Boucheron,et al.  Sharp threshold for percolation on expanders , 2009, 0906.3657.

[8]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  Hao Huang,et al.  The Size of a Hypergraph and its Matching Number , 2011, Combinatorics, Probability and Computing.

[10]  Peter Keevash,et al.  A stability result for the cube edge isoperimetric inequality , 2017, J. Comb. Theory, Ser. A.

[11]  Elchanan Mossel Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.

[12]  O. Schramm,et al.  Quantitative noise sensitivity and exceptional times for percolation , 2005, math/0504586.

[13]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[14]  B. Eynard,et al.  Random matrices. , 2015, 1510.04430.

[15]  D. Achlioptas,et al.  A sharp threshold for k-colorability , 1999 .

[16]  Hamed Hatami A structure theorem for Boolean functions with small total influences , 2010, 1008.1021.

[17]  Subhash Khot,et al.  Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[18]  Nathan Linial,et al.  Collective Coin Flipping , 1989, Adv. Comput. Res..

[19]  I. Benjamini,et al.  Noise sensitivity of random walks on groups , 2019, 1901.03617.

[20]  Suresh Venkatasubramanian,et al.  A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds , 2015, STOC.

[21]  Elchanan Mossel,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, IEEE Annual Symposium on Foundations of Computer Science.

[22]  The Junta Method for Hypergraphs and the Erd\H{o}s-Chv\'{a}tal Simplex Conjecture , 2017, 1707.02643.

[23]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[24]  W. Beckner Inequalities in Fourier analysis , 1975 .

[25]  Irit Dinur,et al.  Intersecting Families are Essentially Contained in Juntas , 2009, Combinatorics, Probability and Computing.

[26]  Alexander Roberts,et al.  Vertex-isoperimetric stability in the hypercube , 2020, J. Comb. Theory, Ser. A.

[27]  Richard Montgomery,et al.  Spanning trees in random graphs , 2018, Advances in Mathematics.

[28]  Peter Keevash,et al.  Stability for vertex isoperimetry in the cube , 2020, J. Comb. Theory, Ser. B.

[29]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[30]  N. Fusco,et al.  The sharp quantitative isoperimetric inequality , 2008 .

[31]  L. Gross LOGARITHMIC SOBOLEV INEQUALITIES. , 1975 .

[32]  G. Kalai,et al.  Every monotone graph property has a sharp threshold , 1996 .

[33]  J. Steif,et al.  Strong noise sensitivity and random graphs , 2013, 1306.6373.

[34]  Noam Lifshitz,et al.  Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems , 2018, 1804.00328.

[35]  Irit Dinur,et al.  Independent Sets in Graph Powers are Almost Contained in Juntas , 2008 .

[36]  C. Borell Geometric bounds on the Ornstein-Uhlenbeck velocity process , 1985 .

[37]  L. Russo An approximate zero-one law , 1982 .

[38]  Béla Bollobás,et al.  Threshold functions , 1987, Comb..

[39]  B. Efron,et al.  The Jackknife Estimate of Variance , 1981 .

[40]  J. Bourgain,et al.  Influences of Variables and Threshold Intervals under Group Symmetries , 1997 .

[41]  M. Stephanov,et al.  Random Matrices , 2005, hep-ph/0509286.

[42]  Stanislav Smirnov,et al.  Critical percolation and conformal invariance , 2006 .

[43]  Subhash Khot,et al.  Small Set Expansion in The Johnson Graph , 2018, Electron. Colloquium Comput. Complex..

[44]  Jeff Kahn,et al.  Thresholds and Expectation Thresholds , 2007, Comb. Probab. Comput..

[45]  J. Kahn,et al.  Factors in random graphs , 2008 .