The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  • Andrews, George E.; Askey, Richard; Roy, Ranjan. Special functions. Encyclopedia of Mathematics and its Applications, 71. Cambridge University Press, Cambridge, 1999. xvi+664 pp. ISBN: 0-521-62321-9; 0-521-78988-5 MR1688958
  • Austrin, Per. Towards sharp inapproximability for any 2-CSP. SIAM J. Comput. 39 (2010), no. 6, 2430--2463. MR2644353
  • Borell, Christer. Geometric bounds on the Ornstein-Uhlenbeck velocity process. Z. Wahrsch. Verw. Gebiete 70 (1985), no. 1, 1--13. MR0795785
  • M. Braverman, K. Makarychev, Y. Makarychev, and A. Naor. The Grothendieck constant is strictly smaller than Krivine's bound. Forum Math. Pi, 1:e4, 42, 2013.
  • Chatterjee, Sourav. A generalization of the Lindeberg principle. Ann. Probab. 34 (2006), no. 6, 2061--2076. MR2294976
  • Corneli, J.; Corwin, I.; Hurder, S.; Sesum, V.; Xu, Y.; Adams, E.; Davis, D.; Lee, M.; Visocchi, R.; Hoffman, N. Double bubbles in Gauss space and spheres. Houston J. Math. 34 (2008), no. 1, 181--204. MR2383703
  • R. Eldan. A two-sided estimate for the Gaussian noise stability deficit. Preprint, arXiv:1307.2781, 2013.
  • Frieze, Alan; Jerrum, Mark. Improved approximation algorithms for MAX $k$-CUT and MAX BISECTION. Integer programming and combinatorial optimization (Copenhagen, 1995), 1--13, Lecture Notes in Comput. Sci., 920, Springer, Berlin, 1995. MR1367967
  • Gross, Leonard. Logarithmic Sobolev inequalities. Amer. J. Math. 97 (1975), no. 4, 1061--1083. MR0420249
  • Heilman, Steven; Jagannath, Aukosh; Naor, Assaf. Solution of the propeller conjecture in $\Bbb{R}^ 3$. Discrete Comput. Geom. 50 (2013), no. 2, 263--305. MR3090520
  • S. Heilman, E. Mossel, and J. Neeman. Standard simplices and pluralities are not the most noise stable. preprint, arXiv:1403.0885, 2014.
  • Isaksson, Marcus; Mossel, Elchanan. Maximally stable Gaussian partitions with discrete applications. Israel J. Math. 189 (2012), 347--396. MR2931402
  • Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37 (2007), no. 1, 319--357. MR2306295
  • Khot, Subhash; Naor, Assaf. Approximate kernel clustering. Mathematika 55 (2009), no. 1-2, 129--165. MR2573605
  • Khot, Subhash; Naor, Assaf. Grothendieck-type inequalities in combinatorial optimization. Comm. Pure Appl. Math. 65 (2012), no. 7, 992--1035. MR2922372
  • Khot, Subhash; Naor, Assaf. Sharp kernel clustering algorithms and their associated Grothendieck inequalities. Random Structures Algorithms 42 (2013), no. 3, 269--300. MR3039681
  • Ledoux, Michel. Isoperimetry and Gaussian analysis. Lectures on probability theory and statistics (Saint-Flour, 1994), 165--294, Lecture Notes in Math., 1648, Springer, Berlin, 1996. MR1600888
  • E. Mossel and J. Neeman. Robust optimality of Gaussian noise stability. Preprint, arXiv:1210.4126, 2012.
  • Mossel, Elchanan; O'Donnell, Ryan; Oleszkiewicz, Krzysztof. Noise stability of functions with low influences: invariance and optimality. Ann. of Math. (2) 171 (2010), no. 1, 295--341. MR2630040
  • Raghavendra, Prasad; Steurer, David. Towards computing the Grothendieck constant. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 525--534, SIAM, Philadelphia, PA, 2009. MR2809257
  • Stein, Elias M. Singular integrals and differentiability properties of functions. Princeton Mathematical Series, No. 30 Princeton University Press, Princeton, N.J. 1970 xiv+290 pp. MR0290095


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.