The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Noise stability of functions with low influences: Invariance and optimality
Open accessAbstract
In this paper we study functions with low influences on product probability spaces.These are functions f W 1 n !ޒ that have EŒVar i Œf small compared to VarŒf for each i .The analysis of boolean functions f W f 1; 1g n !f 1; 1g with low influences has become a central problem in discrete Fourier analysis.It is motivated by fundamental questions arising from the construction of probabilistically checkable proofs in theoretical computer science and from problems in the theory of social choice in economics.We prove an invariance principle for multilinear polynomials with low influences and bounded degree; it shows that under mild conditions the distribution of such polynomials is essentially invariant for all product spaces.Ours is one of the very few known nonlinear invariance principles.It has the advantage that its proof is simple and that its error bounds are explicit.We also show that the assumption of bounded degree can be eliminated if the polynomials are slightly "smoothed"; this extension is essential for our applications to "noise stability"-type problems.In particular, as applications of the invariance principle we prove two conjectures: Khot, Kindler, Mossel, and O'Donnell's "Majority Is Stablest" conjecture from theoretical computer science, which was the original motivation for this work, and Kalai and Friedgut's "It Ain't Over Till It's Over" conjecture from social choice theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
Inequalities in Fourier Analysis
Beckner, W. (1975) · The Annals of Mathematics · doi:10.2307/1970980 · Cited by 1,290
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Janson, S. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511526169 · Cited by 970
Vertex cover might be hard to approximate to within 2−ε
Khot, S., & Regev, O. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.019 · Cited by 795
Sharp thresholds of graph properties, and the $k$-sat problem
Friedgut, E., & Jean Bourgain, A. B. (1999) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-99-00305-7 · Cited by 678
On the hardness of approximating vertex cover
Dinur, I., & Safra, S. (2005) · Annals of Mathematics · doi:10.4007/annals.2005.162.439 · Cited by 636
The influence of variables on Boolean functions
Kahn, J., Kalai, G., & Linial, N. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21923 · Cited by 620
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Khot, S., Kindler, G., Mossel, E., & O’Donnell, R. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447372 · Cited by 578
Self-citationEvery monotone graph property has a sharp threshold
Friedgut, E., & Kalai, G. (1996) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-96-03732-x · Cited by 412
Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung
Lindeberg, J. W. (1922) · Mathematische Zeitschrift · doi:10.1007/bf01494395 · Cited by 400
Optimal algorithms and inapproximability results for every CSP?
Raghavendra, P. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374414 · Cited by 384
Khot, S. A., & Vishnoi, N. K. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.74 · Cited by 263
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
Friedgut, E. (1998) · COMBINATORICA · doi:10.1007/pl00009809 · Cited by 237
On Russo's Approximate Zero-One Law
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988612 · Cited by 236
Bobkov, S. G. (1997) · The Annals of Probability · doi:10.1214/aop/1024404285 · Cited by 139
Geometric bounds on the Ornstein-Uhlenbeck velocity process
Borell, C. (1985) · Probability Theory and Related Fields · doi:10.1007/bf00532234 · Cited by 136
Noise stability of functions with low in.uences invariance and optimality
Mossel, E., O’Donnell, R., & Oleszkiewicz, K. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.53 · Cited by 132
Self-citationOn the optimality of the random hyperplane rounding technique for MAX CUT
Feige, U., & Schechtman, G. (2002) · Random Structures and Algorithms · doi:10.1002/rsa.10036 · Cited by 127
Gowers uniformity, influence of variables, and PCPs
Samorodnitsky, A., & Trevisan, L. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132519 · Cited by 100
Note on the Berry-Esseen Theorem
Katz, M. L. (1963) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704037 · Cited by 76
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
de Klerk, E., Ṗasechnik, D. V., & Warners, J. P. (2004) · Journal of Combinatorial Optimization · doi:10.1023/b:joco.0000038911.67280.3f · Cited by 76
Influences of Variables and Threshold Intervals under Group Symmetries
Bourgain, J., & Kalai, G. (1997) · Geometric and Functional Analysis · doi:10.1007/s000390050015 · Cited by 70
Balanced max 2-sat might not be the hardest
Austrin, P. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250818 · Cited by 63
An optimal sdp algorithm for max-cut, and equally optimal long code tests
O’Donnell, R., & Wu, Y. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374425 · Cited by 61
Self-citationConditional hardness for approximate coloring
Dinur, I., Mossel, E., & Regev, O. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132567 · Cited by 58
Self-citationOn the Fourier tails of bounded functions over the discrete cube
Dinur, I., Friedgut, E., Kindler, G., & O’Donnell, R. (2007) · Israel Journal of Mathematics · doi:10.1007/s11856-007-0068-9 · Cited by 47
Self-citation
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Self-citationClassical command of quantum systems
Reichardt, B. W., Unger, F., & Vazirani, U. (2013) · Nature · doi:10.1038/nature12035 · Cited by 294
Metadata
- Authors
- Mossel, E., O’Donnell, R., & Oleszkiewicz, K.
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2010-03-17
- Volume
- 171
- Issue
- 1
- Pages
- 295-341
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2078929687
- Cited by
- 288
- References
- 28
- FWCI
- 41.23
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.