Concentration on the Boolean hypercube via pathwise stochastic analysis

Springer Science and Business Media LLC - Tập 230 Số 3 - Trang 935-994 - 2022
Eldan, Ronen1, Gross, Renan1
1Weizmann Institute of Science, Rehovot, Israel

Tóm tắt

We develop a new technique for proving concentration inequalities which relate the variance and influences of Boolean functions. Using this technique, we Our proofs rely on techniques based on stochastic calculus, and bypass the use of hypercontractivity common to previous proofs.

Tài liệu tham khảo

citation_journal_title=Probab. Theory Relat. Fields; citation_title=The self-dual point of the two-dimensional random-cluster model is critical for ; citation_author=V Beffara, H Duminil-Copin; citation_volume=153; citation_issue=3–4; citation_publication_date=2012; citation_pages=511-542; citation_doi=10.1007/s00440-011-0353-8; citation_id=CR1 citation_journal_title=Inst. Hautes Études Sci. Publ. Math.; citation_title=Noise sensitivity of Boolean functions and applications to percolation; citation_author=I Benjamini, G Kalai, O Schramm; citation_volume=90; citation_publication_date=1999; citation_pages=5-43; citation_doi=10.1007/BF02698830; citation_id=CR2 citation_journal_title=Ann. Probab.; citation_title=First passage percolation has sublinear distance variance; citation_author=I Benjamini, G Kalai, O Schramm; citation_volume=31; citation_issue=4; citation_publication_date=2003; citation_pages=1970-1978; citation_doi=10.1214/aop/1068646373; citation_id=CR3 citation_journal_title=Ann. Inst. H. Poincaré Probab. Statist.; citation_title=Some remarks on isoperimetry of Gaussian type; citation_author=F Barthe, B Maurey; citation_volume=36; citation_issue=4; citation_publication_date=2000; citation_pages=419-434; citation_doi=10.1016/S0246-0203(00)00131-X; citation_id=CR4 citation_journal_title=Ann. Probab.; citation_title=An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space; citation_author=SG Bobkov; citation_volume=25; citation_issue=1; citation_publication_date=1997; citation_pages=206-214; citation_doi=10.1214/aop/1024404285; citation_id=CR5 citation_title=Convex Optimization; citation_publication_date=2004; citation_id=CR6; citation_author=S Boyd; citation_author=L Vandenberghe; citation_publisher=Cambridge University Press citation_title=Hypercontractive Measures, Talagrand’s Inequality, and Influences; citation_publication_date=2012; citation_id=CR7; citation_author=D Cordero-Erausquin; citation_author=M Ledoux; citation_publisher=Springer citation_journal_title=Electron. Commun. Probab.; citation_title=Martingale representation and a simple proof of logarithmic Sobolev inequalities on path spaces; citation_author=M Capitaine, EP Hsu, M Ledoux; citation_volume=2; citation_publication_date=1997; citation_pages=71-81; citation_doi=10.1214/ECP.v2-986; citation_id=CR8 citation_journal_title=Ann. Math. (2); citation_title=On the hardness of approximating minimum vertex cover; citation_author=I Dinur, S Safra; citation_volume=162; citation_issue=1; citation_publication_date=2005; citation_pages=439-485; citation_doi=10.4007/annals.2005.162.439; citation_id=CR9 Durrett, R.: Probability—theory and examples. In: Cambridge Series in Statistical and Probabilistic Mathematics, vol. 49. Cambridge University Press, Cambridge (2019) citation_journal_title=Invent. Math.; citation_title=A two-sided estimate for the Gaussian noise stability deficit; citation_author=R Eldan; citation_volume=201; citation_issue=2; citation_publication_date=2015; citation_pages=561-624; citation_doi=10.1007/s00222-014-0556-6; citation_id=CR11 Eldan, R.: Second-order bounds on correlations between increasing families Eldan, R.: Analysis of high-dimensional distributions using pathwise methods. In: 2022 ICM Proceedings (2021) citation_journal_title=Combin. Probab. Comput.; citation_title=Almost isoperimetric subsets of the discrete cube; citation_author=D Ellis; citation_volume=20; citation_issue=3; citation_publication_date=2011; citation_pages=363-380; citation_doi=10.1017/S0963548311000083; citation_id=CR14 citation_journal_title=Combinatorica; citation_title=Boolean functions with low average sensitivity depend on few coordinates; citation_author=E Friedgut; citation_volume=18; citation_issue=1; citation_publication_date=1998; citation_pages=27-35; citation_doi=10.1007/PL00009809; citation_id=CR15 citation_journal_title=J. Am. Math. Soc.; citation_title=Sharp thresholds of graph properties, and the -sat problem; citation_author=E Friedgut; citation_volume=12; citation_issue=4; citation_publication_date=1999; citation_pages=1017-1054; citation_doi=10.1090/S0894-0347-99-00305-7; citation_id=CR16 Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput. 38(5), 1695–1708 (2008/2009) Garban, C., Steif, J.E.: Noise sensitivity of Boolean functions and percolation. In: Institute of Mathematical Statistics Textbooks, vol. 5. Cambridge University Press, New York (2015) citation_journal_title=Discrete Math.; citation_title=A note on the edges of the -cube; citation_author=S Hart; citation_volume=14; citation_issue=2; citation_publication_date=1976; citation_pages=157-163; citation_doi=10.1016/0012-365X(76)90058-3; citation_id=CR19 Kingman, J.F.C.: Poisson processes. In: Oxford Studies in Probability, vol. 3, The Clarendon Press, Oxford University Press, New York, Oxford Science Publications (1993) citation_journal_title=Combin. Probab. Comput.; citation_title=Thresholds and expectation thresholds; citation_author=J Kahn, G Kalai; citation_volume=16; citation_issue=3; citation_publication_date=2007; citation_pages=495-502; citation_doi=10.1017/S0963548307008474; citation_id=CR21 citation_journal_title=Combinatorica; citation_title=Quantitative relation between noise sensitivity and influences; citation_author=N Keller, G Kindler; citation_volume=33; citation_issue=1; citation_publication_date=2013; citation_pages=45-71; citation_doi=10.1007/s00493-013-2719-2; citation_id=CR22 Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions (extended abstract). pp. 68–80 (1988) Klein, S., Levi, A., Safra, M., Shikhelman, C., Spinka, Y.: On the converse of Talagrand’s influence inequality. arXiv:1506.06325 (2015) citation_journal_title=SIAM J. Comput.; citation_title=Improved lower bounds for embeddings into ; citation_author=R Krauthgamer, Y Rabani; citation_volume=38; citation_issue=6; citation_publication_date=2009; citation_pages=2487-2498; citation_doi=10.1137/060660126; citation_id=CR25 Kalai, G., Safra, S.: Threshold phenomena and influence: perspectives from mathematics, computer science, and economics. In: Computational Complexity and Statistical Physics, St. Fe Inst. Stud. Sci. Complex., Oxford University Press, New York, pp. 25–60 (2006) citation_journal_title=Auton. Agent. Multi-Agent Syst.; citation_title=Majority dynamics and aggregation of information in social networks; citation_author=E Mossel, J Neeman, O Tamuz; citation_volume=28; citation_issue=3; citation_publication_date=2014; citation_pages=408-429; citation_doi=10.1007/s10458-013-9230-4; citation_id=CR27 citation_title=Analysis of Boolean Functions; citation_publication_date=2014; citation_id=CR28; citation_author=R O’Donnell; citation_publisher=Cambridge University Press citation_journal_title=SIAM J. Comput.; citation_title=Learning monotone decision trees in polynomial time; citation_author=R O’Donnell, RA Servedio; citation_volume=37; citation_issue=3; citation_publication_date=2007; citation_pages=827-844; citation_doi=10.1137/060669309; citation_id=CR29 citation_journal_title=Comput. Complex.; citation_title=Fourier analysis for probabilistic communication complexity; citation_author=R Raz; citation_volume=5; citation_issue=3–4; citation_publication_date=1995; citation_pages=205-221; citation_doi=10.1007/BF01206318; citation_id=CR30 citation_journal_title=Geom. Funct. Anal.; citation_title=Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis’ graph connectivity theorem; citation_author=M Talagrand; citation_volume=3; citation_issue=3; citation_publication_date=1993; citation_pages=295-314; citation_doi=10.1007/BF01895691; citation_id=CR31 citation_journal_title=Ann. Probab.; citation_title=On Russo’s approximate zero-one law; citation_author=M Talagrand; citation_volume=22; citation_issue=3; citation_publication_date=1994; citation_pages=1576-1587; citation_doi=10.1214/aop/1176988612; citation_id=CR32 citation_journal_title=Combinatorica; citation_title=How much are increasing sets positively correlated?; citation_author=M Talagrand; citation_volume=16; citation_issue=2; citation_publication_date=1996; citation_pages=243-258; citation_doi=10.1007/BF01844850; citation_id=CR33 citation_journal_title=Combinatorica; citation_title=On boundaries and influences; citation_author=M Talagrand; citation_volume=17; citation_issue=2; citation_publication_date=1997; citation_pages=275-285; citation_doi=10.1007/BF01200910; citation_id=CR34