Hypercontractivity and its applications

Hypercontractive inequalities are a useful tool in dealing with extremal questions in the geometry of high-dimensional discrete and continuous spaces. In this survey we trace a few connections between different manifestations of hypercontractivity, and also present some relatively recent applications of these techniques in computer science.

[1]  Jonah Sherman,et al.  Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

[3]  Jonathan L. Gross.  Every connected regular graph of even degree is a Schreier coset graph , 1977, J. Comb. Theory, Ser. B.

[4]  C. Borell.  Positivity improving operators and hypercontractivity , 1982 .

[5]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[6]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[7]  M. Talagrand.  Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.

[8]  Ryan O'Donnell,et al.  3-bit Dictator Testing: 1 vs. 5/8 , 2009, SODA.

[9]  Ryan O'Donnell,et al.  KKL, Kruskal-Katona, and Monotone Nets , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[10]  James R. Lee,et al.  On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.

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

[12]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.