The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Concentration of measure and isoperimetric inequalities in product spaces
Open accessAbstract
The concentration of measure phenomenon in product spaces roughly states that, if a set A in a product Ω N of probability spaces has measure at least one half, “most” of the points of Ω n are “close” to A. We proceed to a systematic exploration of this phenomenon. The meaning of the word “most” is made rigorous by isoperimetrictype inequalities that bound the measure of the exceptional sets. The meaning of the work “close” is defined in three main ways, each of them giving rise to related, but different inequalities. The inequalities are all proved through a common scheme of proof. Remarkably, this simple approach not only yields qualitatively optimal results, but, in many cases, captures near optimal numerical constants. A large number of applications are given, in particular to Percolation, Geometric Probability, Probability in Banach Spaces, to demonstrate in concrete situations the extremely wide range of application of the abstract tools.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
(1976) · Lecture Notes in Mathematics · doi:10.1007/bfb0082336 · Cited by 1,297
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Self-citationAsymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
A Topological Application of the Isoperimetric Inequality
Gromov, M., & Milman, V. D. (1983) · American Journal of Mathematics · doi:10.2307/2374298 · Cited by 361
The chromatic number of random graphs
Bollobás, B. (1988) · Combinatorica · doi:10.1007/bf02122551 · Cited by 360
Poisson approximation for large deviations
Janson, S. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010209 · Cited by 207
Cited by
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Concentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
On the geometry of metric measure spaces. II
Sturm, K.-T. (2006) · Acta Mathematica · doi:10.1007/s11511-006-0003-7 · Cited by 1,149
Concentration of Measure for the Analysis of Randomized Algorithms
Dubhashi, D. P., & Panconesi, A. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511581274 · Cited by 945
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
On the geometry of metric measure spaces
Sturm, K.-T. (2006) · Acta Mathematica · doi:10.1007/s11511-006-0002-8 · Cited by 835
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
A dynamic model of social network formation
Skyrms, B., & Pemantle, R. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.16.9340 · Cited by 553
Introduction to Statistical Learning Theory
Bousquet, O., Boucheron, S., & Lugosi, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_8 · Cited by 503
Hanson-Wright inequality and sub-gaussian concentration
Rudelson, M., & Vershynin, R. (2013) · Electronic Communications in Probability · doi:10.1214/ecp.v18-2865 · Cited by 502
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Self-citationTheory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
McDiarmid, C. (1998) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12788-9_6 · Cited by 405
Mathematical Foundations of Infinite-Dimensional Statistical Models
Giné, E., & Nickl, R. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107337862 · Cited by 402
Isoperimetry and Gaussian analysis
Ledoux, M. (1996) · Lecture Notes in Mathematics · doi:10.1007/bfb0095676 · Cited by 328
Talagrand, M. (1996) · The Annals of Probability · doi:10.1214/aop/1042644705 · Cited by 325
Self-citationDense Error Correction Via $\ell^1$-Minimization
Wright, J., & Ma, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048473 · Cited by 305
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Non-asymptotic Theory of Random Matrices: Extreme Singular Values
Rudelson, M., & Vershynin, R. (2011) · Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) · doi:10.1142/9789814324359_0111 · Cited by 296
About the constants in Talagrand's concentration inequalities for empirical processes
Massart, P. (2000) · The Annals of Probability · doi:10.1214/aop/1019160263 · Cited by 280
Weed, J., & Bach, F. (2019) · Bernoulli · doi:10.3150/18-bej1065 · Cited by 275
On Talagrand's deviation inequalities for product measures
Ledoux, M. (1997) · ESAIM: Probability and Statistics · doi:10.1051/ps:1997103 · Cited by 255
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]
Goldwasser, S., Kim, M. P., Vaikuntanathan, V., & Zamir, O. (2022) · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs54457.2022.00092 · Cited by 41
Metadata
- Authors
- Talagrand, M.
- Venue
- Publications Mathématiques de l'IHÉS
- Publisher
- MathDoc/Centre Mersenne
- Published
- 1995-12-07
- Volume
- 81
- Pages
- 73-205
- ISSN
- 0073-8301 (ISSN-L)
- 1618-1913
- OpenAlex
- W1973286131
- Cited by
- 829
- References
- 15
- FWCI
- 36.38
- Type
- journal article
- Language
- en
- Open access
- green
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.