Non-asymptotic theory of random matrices: Extreme singular values

Proceedings of the International Congress of Mathematicians 2010, ICM 2010

Volumn , Issue , 2010, Pages 1576-1602

  Rudelson, Mark ^a   Vershynin, Roman ^b  

^a UNIVERSITY OF MISSOURI   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Hard edge; Littlewood Offord problem; Random matrices; Singular values; Small ball probability

Indexed keywords

GEOMETRIC METHOD; HARD EDGE; LITTLEWOOD-OFFORD PROBLEM; RANDOM MATRICES; RANDOM MATRIX THEORY; SINGULAR VALUES; SINGULAR VALUES OF RANDOM MATRICES; SPECTRAL PROPERTIES;

GEOMETRY; INFORMATION THEORY; RANDOM VARIABLES;

ASYMPTOTIC ANALYSIS;

EID: 84877883600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (97)

1. R. Adamczak, A. Litvak, A. Pajor, N. Tomczak-Jaegermann, Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles, J. Amer. Math. Soc. 23 (2010), 535-561.
2. 1, Israel J. Math. 156 (2006), 141-155.
3. G. Aubrun, A sharp small deviation inequality for the largest eigenvalue of a random matrix, Séminaire de Probabilités XXXVIII, 320-337, Lecture Notes in Math., 1857, Springer, Berlin, 2005.
4. Z. D. Bai, Circular law, Ann. Probab. 25 (1997), no. 1, 494-529.
5. Z. D. Bai, Methodologies in spectral analysis of large dimensional random matrices, a review, Statistica Sinica 9 (1999), 611-677
6. Z. D. Bai, J. Silverstein, Spectral analysis of large dimensional random matrices, 2nd ed., Springer Series in Statistics, Springer, New York, 2010.
7. Z. D. Bai, J. Silverstein, Y. Q. Yin, A note on the largest eigenvalue of a large-dimensional sample covariance matrix, J. Multivariate Anal. 26 (1988), 166-168.
8. Z. D. Bai, Y. Q. Yin, Limit of the smallest eigenvalue of a large-dimensional sample covariance matrix, Ann. Probab. 21 (1993), 1275-1294.
9. R. Baraniuk, M. Davenport, R. DeVore, M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx. 28 (2008), 253-263.
10. p, 1 < p < 2, Israel J. Math. 26 (1977), 178-187.
11. A. C. Berry, The accuracy of the Gaussian approximation to the sum of independent variables, Trans. Amer. Math. Soc., 49 (1941), 122-136.
12. J. Bourgain, P. Wood, V. Vu, On the singularity probability of random discrete matrices, submitted.
13. T. Cai, L. Wang, and G. Xu, Shifting Inequality and Recovery of Sparse Signals, IEEE Transactions on Signal Processing, to appear.
14. E. Candés, Compressive sampling, International Congress of Mathematicians. Vol. III, 1433-1452, Eur. Math. Soc., Zürich, 2006.
15. E. Candés, The restricted isometry property and its implications for compressed sensing, C. R. Math. Acad. Sci. Paris 346 (2008), 589-592.
16. E. Candés, T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory 51 (2005), 4203-4215.
17. E. Candés, T. Tao, Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 (2006), 5406-5425.
18. E. Candés, M. B. Wakin, An Introduction To Compressive Sampling, IEEE Signal Processing Magazine, V.21, March 2008.
19. K. R. Davidson, S. J. Szarek, Local operator theory, random matrices and Banach spaces. Handbook of the geometry of Banach spaces, Vol. I, 317-366, North-Holland, Amsterdam, 2001.
20. A. Edelman, Eigenvalues and condition numbers of random matrices, SIAM J. Matrix Anal. Appl. 9 (1988), 543-560
21. P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898-902
22. P. Erdös, Extremal problems in number theory, 1965 Proc. Sympos. Pure Math., Vol. VIII, pp. 181-189 AMS, Providence, R.I.
23. C. G. Esseen, Fourier analysis of distribution functions. A mathematical study of the laplace Gaussian law, Acta Math. 77 (1945), 1-125.
24. C. G. Esseen, On the Kolmogorov-Rogozin inequality for the concentration function, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 5 (1966), 210-216.
25. O. Feldheim, S. Sodin, A universality result for the smallest eigenvalues of certain sample covariance matrices, Geometric and Functional Analysis, to appear
26. P. Frankl, Z. Füredi, Solution of the Littlewood-Offord problem in high dimensions, Ann. of Math. (2) 128 (1988), 259-270.
27. O. Friedland, S. Sodin, Bounds on the concentration function in terms of the Diophantine approximation, C. R. Math. Acad. Sci. Paris 345 (2007), 513-518.
28. A. Garnaev, E. Gluskin, The widths of a Euclidean ball, Soviet Math. Dokl. 30 (1984), 200-204.
29. S. Geman, A limit theorem for the norm of random matrices, Ann. Probab. 8 (1980), 252-261.
30. V. L. Girko, The circular law, Theory Probab. Appl. 29 (1984), no. 4, 694-706.
31. Y. Gordon, On Dvoretzky's theorem and extensions of Slepian's lemma, Israel seminar on geometrical aspects of functional analysis (1983/84), II, Tel Aviv Univ., Tel Aviv, 1984.
32. Y. Gordon, Some inequalities for Gaussian processes and applications, Israel J. Math. 50 (1985), 265-289.
33. Y. Gordon, Majorization of Gaussian processes and geometric applications, Probab. Theory Related Fields 91 (1992), 251-267.
34. F. Götze, A. Tikhomirov, On the Circular Law, arXiv:math/0702386.
35. F. Götze, A. Tikhomirov, The Circular Law for Random Matrices, arXiv:0709.3995, to appear in Ann. Prob.
36. P. Indyk, Dimensionality reduction techniques for proximity problems, Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 2000.
37. K. Johansson, Shape fluctuations and random matrices, Comm. Math. Phys. 209 (2000), 437-476.
38. p, Geom. Funct. Anal. 13 (2003), no. 4, 845-851.
39. I. M. Johnstone, On the distribution of the largest eigenvalue in principal components analysis, Ann. Statist. 29 (2001), 295-327.
40. G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Periodica Mathematica Hungarica 8 (1977), 197-211
41. B. Kashin, Section of some finite-dimensional sets and classes of smooth functions (in Russian) Izv. Acad. Nauk. SSSR 41 (1977) 334-351.
42. A. Kolmogorov, Sur les propriétés des fonctions de concentrations de M. P. Lévy, Ann. Inst. H. Poincaré 16 (1958), 27-34.
43. J. Kahn, J. Komlós, E. Szemerédi, On the probability that a random ±1-matrix is singular, J. Amer. Math. Soc. 8 (1995), 223-240.
44. J. Komlós, On the determinant of (0, 1) matrices, Studia Sci. Math. Hungar. 2 (1967), 7-22.
45. J. Komlós, On the determinant of random matrices, Studia Sci. Math. Hungar. 3 (1968), 387-399.
46. R. Latala, Some estimates of norms of random matrices, Proc. Amer. Math. Soc. 133 (2005), 1273-1282.
47. M. Ledoux, The concentration of measure phenomenon. Mathematical Surveys and Monographs, 89. American Mathematical Society, Providence, RI, 2001.
48. M. Ledoux, Deviation inequalities on largest eigenvalues, Geometric aspects of functional analysis, 167-219, Lecture Notes in Math., 1910, Springer, Berlin, 2007.
49. M. Ledoux, M. Talagrand, Probability in Banach spaces. Isoperimetry and processes. Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 23. Springer Verlag, Berlin, 1991.
50. P. Lévy, Théorie de l'addition des variables aléatoires, Gauthier-Villars, 1937.
51. W. V. Li, Q.-M. Shao, Gaussian processes: inequalities, small ball probabilities and applications. Stochastic processes: theory and methods, 533-597, Handbook of Statistics, 19, North-Holland, Amsterdam, 2001.
52. J. E. Littlewood, A. C. Offord, On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat. Sbornik] N.S. 12(54), (1943), 277-286
53. A. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195 (2005), 491-523.
54. A. E. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, R. Vershynin, Euclidean embeddings in spaces of finite volume ratio via random matrices, J. Reine Angew. Math. 589 (2005), 1-19.
55. V. A. Marchenko, L. A. Pastur, The distribution of eigenvalues in certain sets of random matrices, Mat. Sb., 72 (1967), 507-536.
56. M. L. Mehta, Random matrices and the statistical theory of energy levels. Academic Press, New York-London 1967.
57. S. Mendelson, A. Pajor, N. Tomczak-Jaegermann, Uniform uncertainty principle for Bernoulli and subgaussian ensembles, Constr. Approx. 28 (2008), 277-289.
58. V. Milman, A new proof of the theorem of A. Dvoretzky on sections of convex bodies, Funct. Anal. Appl. 5 (1971), 28-37.
59. V. D. Milman, G. Schechtman, Asymptotic theory of finite-dimensional normed spaces. With an appendix by M. Gromov. Lecture Notes in Math. 1200, Springer Verlag, Berlin 1986.
60. L. A Pastur, On the spectrum of random matrices, Teoret. Mat. Fiz. 10 (1973), 102-112.
61. V. V. Petrov, Sums of independent random variables. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 82. Springer-Verlag, New York-Heidelberg, 1975.
62. M. Rudelson, Lower estimates for the singular values of random matrices, C. R. Math. Acad. Sci. Paris 342 (2006), 247-252.
63. M. Rudelson, Invertibility of random matrices: norm of the inverse, Annals of Mathematics 168 (2008), 575-600.
64. M. Rudelson, R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Communications on Pure and Applied Mathematics 61 (2008), 1025-1045.
65. M. Rudelson, R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices, Adv. Math. 218 (2008), 600-633.
66. -1/2), Comptes rendus de l'Académie des sciences - Mathématique 346 (2008), 893-896.
67. M. Rudelson, R. Vershynin, Smallest singular value of a random rectangular matrix, Comm. Pure Appl. Math. 62 (2009), 1707-1739.
68. A. Sankar, D. A. Spielman, S.-H. Teng, Smoothed analysis of the condition numbers and growth factors of matrices, SIAM J. Matrix Anal. Appl. 28 (2006), 446-476.
69. A. Sárközy, E. Szeméredi, Über ein Problem von Erdös und Moser, Acta Arithmetica 11 (1965), 205-208
70. G. Schechtman, Random embeddings of Euclidean spaces in sequence spaces, Israel Journal of Mathematics 40, No. 2, 1981, 187-192.
71. J. Silverstein, The smallest eigenvalue of a large-dimensional Wishart matrix, Ann. Probab. 13 (1985), 1364-1368.
72. D. Slepian, The one-sided barrier problem for Gaussian noise, Bell System Tech. J. 41 (1962), 463-501.
73. S. Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. (N.S.) 13 (1985), 87-121
74. A. Soshnikov, A note on universality of the distribution of the largest eigenvalues in certain sample covariance matrices, J. Statist. Phys. 108 (2002), 1033-1056.
75. D. Spielman, S.-H. Teng, Smoothed analysis of algorithms. Proceedings of the International Congress of Mathematicians, Vol. I (Beijing, 2002), 597-606, Higher Ed. Press, Beijing, 2002
76. M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Inst. Hautes Études Sci. Publ. Math. No. 81 (1995), 73-205.
77. M. Talagrand, A new look at independence, Ann. Probab. 24 (1996), 1-34.
78. T. Tao, V. Vu, On random ±1 matrices: singularity and determinant, Random Structures and Algorithms 28 (2006), 1-23.
79. S. Szarek, Condition numbers of random matrices, J. Complexity 7 (1991), 131-149.
80. T. Tao, V. Vu, Additive combinatorics. Cambridge Studies in Advanced Mathematics, 105. Cambridge University Press, Cambridge, 2006.
81. T. Tao, V. Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. 20 (2007), 603-628.
82. T. Tao, V. Vu, Random matrices: the circular law, Commun. Contemp. Math. 10 (2008), no. 2, 261-307.
83. T. Tao, V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Annals of Math. 169 (2009), 595-632.
84. T. Tao, V. Vu, From the Littlewood-Offord problem to the circular law: universality of the spectral distribution of random matrices, Bull. Amer. Math. Soc. 46 (2009), 377-396.
85. T. Tao, V. Vu (with appendix by M. Krishnapur), Random matrices: Universality of ESDs and the circular law, arXiv:0808.4898, to appear in Ann. Prob.
86. T. Tao, V. Vu, A sharp inverse Littlewood-Offord theorem, Random Structures and Algorithms, to appear
87. T. Tao, V. Vu, Random matrices: the distribution of smallest singular values, Geom. Funct. Anal., to appear
88. T. Tao, V. Vu, The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi, preprint
89. C. Tracy, H. Widom, Level-Spacing Distributions and the Airy Kernel, Comm. Math. Phys. 159 (1994), 151-174.
90. C. Tracy, H. Widom, On orthogonal and symplectic matrix ensembles, Comm. Math. Phys. 177 (1996), no. 3, 727-754.
91. C. Tracy, H. Widom, Distribution functions for largest eigenvalues and their applications, Proceedings of the International Congress of Mathematicians, Vol. I (Beijing, 2002), 587-596, Higher Ed. Press, Beijing, 2002.
92. J. von Neumann, H. H. Goldstine, Numerical inverting of matrices of high order, Bull. Amer. Math. Soc. 53 (1947), 1021-1099.
93. R. Vershynin, Spectral norm of products of random and deterministic matrices, Probability Theory and Related Fields, DOI: 10.1007/s00440-010-0281-z.
94. R. Vershynin, How close is the sample covariance matrix to the actual covariance matrix? preprint.
95. K. W. Wachter, Strong limits of random matrix spectra for sample covariance matrices of independent elements, Annals of Probability 6 (1978), 1-18.
96. P. Wigner, On the distribution of the roots of certain symmetric matrices, Annals of Mathematics 67 (1958), 325-327.
97. Y. Q. Yin, Z. D. Bai, P. R. Krishnaiah, On the limit of the largest eigenvalue of the large-dimensional sample covariance matrix, Probab. Theory Related Fields 78 (1988), 509-521.