Gaussian bounds for noise correlation of functions and tight analysis of long codes

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 156-165

  Mossel, Elchanan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE NUMBER THEORIES; ARBITRARY NUMBERS; BOUNDED DEGREES; CORRELATED PROBABILITIES; EXPECTED VALUES; FOURIER THEORIES; GAUSSIAN; HARDNESS OF APPROXIMATIONS; INDEPENDENT AND IDENTICALLY DISTRIBUTED; INFLUENCE FUNCTIONS; INVARIANCE PRINCIPLES; K FUNCTIONS; LONG CODES; MULTI-DIMENSIONAL; MULTILINEAR POLYNOMIALS; NEW RESULTS; NOISE CORRELATIONS; SOCIAL CHOICES; TIGHT BOUNDS; UNIQUE GAMES CONJECTURES; VOTING SCHEMES;

CLUSTER ANALYSIS; CODES (SYMBOLS); COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; FUNCTIONS; GAME THEORY; NUMBER THEORY; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; RANDOM VARIABLES; SUBSIDENCE; THEOREM PROVING; TRELLIS CODES;

PROBABILITY DISTRIBUTIONS;

EID: 57949096136     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.44     Document Type: Conference Paper

References (19)

1. K. Arrow. A difficulty in the theory of social welfare. J. of Political Economy, 58:328-346, 1950.
2. P. Austrin. Towards Sharp Inapproximability For Any 2-CSP. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 307-317, 2007.
3. P. Austrin and E. Mossel. Approximation resistant predicates from pairwise independence. In 23rd Annual IEEE Conference on Computational Complexity, pages 249-258, Los Alamitos, CA, USA, 2008. IEEE Computer Society.
4. C. E. Bell. A random voting graph almost surely has a hamiltonian cycle when the number of alternatives is large. Econometrica, 49(6): 1597-1603, 1981.
5. C. Borell. Geometric bounds on the Ornstein-Uhlenbeck velocity process. Z. Wahrsch. Verw. Gebiete, 70(1):1-13, 1985.
6. I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (STOC 2006), pages 344-353, 2006.
7. B. Efron and C. Stein. The jacknife estimate of variance. Annals of Statistics, 9(3), 1996.
8. B. Green. A Szemerédi-type regularity lemma in abelian groups, with applications. Geom. Funct. Anal., 15(2):340-376, 2005.
9. J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 68-80, 1988.
10. G. Kalai. A Fourier-theoretic perspective on the Concordet paradox and Arrow's theorem. Adv. in Appl. Math., 29(3):412-426, 2002.
11. G. Kalai. Social Indeterminacy. Econometrica, 72:1565-1581, 2004.
12. S. Khot. On the power of unique 2-prover 1-round games. In Proc. 34th Ann. STOC, pages 767-775, 2002.
13. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable csps? SIAM J. Comput., 37:319-357, 2007.
14. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality (extended abstract). In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pages 21-30. IEEE Computer Society, 2005.
15. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. To appear in Ann. Math., 2008.
16. R. O'Donnell. Hardness amplification within np. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
17. P. Raghavendra. Optimal Algorithms and Inapproximability Results For Every CSP? In Proceedings of the 40th Annual Symposium on Theory of Computing (STOC), pages 245-254, 2008.
18. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and PCPs. In. STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 11-20, New York, NY, USA, 2006. ACM Press.
19. W. Sheppard. On the application of the theory of error to cases of normal distribution and normal correlation. Phil. Trans. Royal Soc. London, 192:101-168, 1899.