The DOI matches its Crossref record.
The Concentration of Measure Phenomenon
Abstract
Concentration functions and inequalities Isoperimetric and functional examples Concentration and geometry Concentration in product spaces Entropy and concentration Transportation cost inequalities Sharp bounds of Gaussian and empirical processes Selected applications References Index.
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
Cited by
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Fan, J., & Lv, J. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00674.x · Cited by 2,711
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
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
An Introduction to Random Matrices
Anderson, G. W., Guionnet, A., & Zeitouni, O. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511801334 · Cited by 1,281
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Ricci curvature for metric-measure spaces via optimal transport
Lott, J., & Villani, C. (2009) · Annals of Mathematics · doi:10.4007/annals.2009.169.903 · Cited by 1,189
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
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
Entanglement and the foundations of statistical mechanics
Popescu, S., Short, A. J., & Winter, A. (2006) · Nature Physics · doi:10.1038/nphys444 · Cited by 1,057
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Equilibration, thermalisation, and the emergence of statistical mechanics in closed quantum systems
Gogolin, C., & Eisert, J. (2016) · Reports on Progress in Physics · doi:10.1088/0034-4885/79/5/056001 · Cited by 999
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
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
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553516 · Cited by 906
The Brunn-Minkowski inequality
Gardner, R. J. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00941-2 · Cited by 894
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 857
Concentration Inequalities and Model Selection
(2007) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-48503-2 · Cited by 744
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Ravikumar, P., Wainwright, M. J., Raskutti, G., & Yu, B. (2011) · Electronic Journal of Statistics · doi:10.1214/11-ejs631 · Cited by 744
HopSkipJumpAttack: A Query-Efficient Decision-Based Attack
Chen, J., Jordan, M. I., & Wainwright, M. J. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00045 · Cited by 718
Ricci curvature of Markov chains on metric spaces
Ollivier, Y. (2009) · Journal of Functional Analysis · doi:10.1016/j.jfa.2008.11.001 · Cited by 712
Compressive Coded Aperture Spectral Imaging: An Introduction
Arce, G. R., Brady, D. J., Carin, L., Arguello, H., & Kittle, D. S. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2278763 · Cited by 661
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Quantum mechanical evolution towards thermal equilibrium
Linden, N., Popescu, S., Short, A. J., & Winter, A. (2009) · Physical Review E · doi:10.1103/physreve.79.061103 · Cited by 625
Restricted isometry properties and nonconvex compressive sensing
Chartrand, R., & Staneva, V. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/3/035020 · Cited by 597
The Ricci Flow: An Introduction
Chow, B., & Knopf, D. (2004) · Mathematical Surveys and Monographs · doi:10.1090/surv/110 · Cited by 579
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
Matrix estimation by Universal Singular Value Thresholding
Chatterjee, S. (2015) · The Annals of Statistics · doi:10.1214/14-aos1272 · Cited by 465
Compressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
Raskutti, G., Wainwright, M. J., & Yu, B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165799 · Cited by 455
Random matrices: Universality of local eigenvalue statistics
Tao, T., & Vu, V. (2011) · Acta Mathematica · doi:10.1007/s11511-011-0061-3 · Cited by 442
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Benaych-Georges, F., & Nadakuditi, R. R. (2011) · Advances in Mathematics · doi:10.1016/j.aim.2011.02.007 · Cited by 441
Random matrices: Universality of ESDs and the circular law
Tao, T., Vu, V., & Krishnapur, M. (2010) · The Annals of Probability · doi:10.1214/10-aop534 · Cited by 415
Living on the edge: phase transitions in convex programs with random data
Amelunxen, D., Lotz, M., McCoy, M. B., & Tropp, J. A. (2014) · Information and Inference · doi:10.1093/imaiai/iau005 · Cited by 413
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. N., & Wainwright, M. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2118 · Cited by 402
Mathematical Foundations of Infinite-Dimensional Statistical Models
Giné, E., & Nickl, R. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107337862 · Cited by 402
Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
Duchi, J. C., Jordan, M. I., Wainwright, M. J., & Wibisono, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2409256 · Cited by 370
Restricted Eigenvalue Properties for Correlated Gaussian Designs
Raskutti, G., Wainwright, M. J., & Yu, B. (2010) · doi:10.5555/1756006.1859929 · Cited by 367
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
Soltanolkotabi, M., Javanmard, A., & Lee, J. D. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2854560 · Cited by 356
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Eldar, Y. C., & Rauhut, H. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034789 · Cited by 356
Koltchinskii, V. (2011) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-22147-7 · Cited by 346
Dense 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
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
The LASSO Risk for Gaussian Matrices
Bayati, M., & Montanari, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2174612 · Cited by 277
Weed, J., & Bach, F. (2019) · Bernoulli · doi:10.3150/18-bej1065 · Cited by 275
A review and assessment of importance sampling methods for reliability analysis
Tabandeh, A., Jia, G., & Gardoni, P. (2022) · Structural Safety · doi:10.1016/j.strusafe.2022.102216 · Cited by 270
Open-system dynamics of entanglement:a key issues review
Aolita, L., de Melo, F., & Davidovich, L. (2015) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-20820 · Cited by 258
BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
ADCOCK, B., HANSEN, A. C., POON, C., & ROMAN, B. (2017) · Forum of Mathematics, Sigma · doi:10.1017/fms.2016.32 · Cited by 256
Local Semicircle Law and Complete Delocalization for Wigner Random Matrices
Erdős, L., Schlein, B., & Yau, H.-T. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-008-0636-9 · Cited by 254
Constrained Few-shot Class-incremental Learning
Hersche, M., Karunaratne, G., Cherubini, G., Benini, L., Sebastian, A., & Rahimi, A. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.00885 · Cited by 167
“This phenomenon is known as concentration of measure [28], with the peculiar property that pseudo-orthogonality converges to exact orthogonality with increasing dimensionality.”
BackgroundComputational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Towards quantum enhanced adversarial robustness in machine learning
West, M. T., Tsang, S.-L., Low, J. S., Hill, C. D., Leckie, C., Hollenberg, L. C. L., Erfani, S. M., & Usman, M. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00661-1 · Cited by 79
“While the COMP suggests that undefended quantum classifiers may be highly vulnerable to attack, recent work has shown that the unique properties of quantum information processing may, on the other hand, offer an opportunity to design new methods of defending against adversarial attacks [21, 23], setting up a fascinating…”
BackgroundInfluentialRemoving Bias in Multi-modal Classifiers: Regularization by Maximizing Functional Entropies
Gat, I., Schwartz, I., Schwing, A., & Hazan, T. (2020) · arXiv · doi:10.48550/arxiv.2010.10802 · Cited by 63
An axiomatic approach to intrinsic dimension of a dataset
Pestov, V. (2008) · Neural Networks · doi:10.1016/j.neunet.2007.12.030 · Cited by 45
Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobian
Oymak, S., Fabian, Z., Li, M., & Soltanolkotabi, M. (2019) · arXiv · doi:10.48550/arxiv.1906.05392 · Cited by 44
Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit
Hayden, P., & Penington, G. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03689-1 · Cited by 40
The phase transition for planar Gaussian percolation models without FKG
Muirhead, S., Rivera, A., Vanneuville, H., & Köhler-Schindler, L. (2020) · arXiv · doi:10.48550/arxiv.2010.11770 · Cited by 21
Metadata
- Authors
- Ledoux, M.
- Venue
- Mathematical Surveys and Monographs
- Publisher
- American Mathematical Society
- Published
- 2005-02-14
- ISSN
- 0885-4653 (ISSN-L)
- 0076-5376
- 2331-7159
- OpenAlex
- W1573820523
- Cited by
- 1,700
- References
- 0
- FWCI
- 30.77
- Type
- book
- Language
- en
- Open access
- closed
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.