-
1
-
-
0031534271
-
Circular law
-
Z. D. Bai, Circular law, Ann. Probab. 25 (1997) 494-529.
-
(1997)
Ann. Probab
, vol.25
, pp. 494-529
-
-
Bai, Z.D.1
-
2
-
-
44249126145
-
Spectral Analysis of Large Dimensional Random Matrices
-
Science Press, Beijing
-
Z. D. Bai and J. Silverstein, Spectral Analysis of Large Dimensional Random Matrices, Mathematics Monograph Series, Vol. 2 (Science Press, Beijing, 2006).
-
(2006)
Mathematics Monograph Series
, vol.2
-
-
Bai, Z.D.1
Silverstein, J.2
-
3
-
-
0003424374
-
-
Society for Industrial and Applied Mathematics, Philadelphia, PA
-
D. Bau and L. Trefethen, Numerical Linear Algebra (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997).
-
(1997)
Numerical Linear Algebra
-
-
Bau, D.1
Trefethen, L.2
-
4
-
-
11844269364
-
-
2nd edn, Cambridge University Press, Cambridge
-
B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, Vol. 73, 2nd edn. (Cambridge University Press, Cambridge, 2001).
-
(2001)
Random Graphs, Cambridge Studies in Advanced Mathematics
, vol.73
-
-
Bollobás, B.1
-
5
-
-
0000324960
-
Eigenvalues and condition numbers of random matrices
-
A. Edelman, Eigenvalues and condition numbers of random matrices, SIAM J. Matrix Anal. Appl. 9(4) (1988) 543-560.
-
(1988)
SIAM J. Matrix Anal. Appl
, vol.9
, Issue.4
, pp. 543-560
-
-
Edelman, A.1
-
6
-
-
0010981220
-
On a lemma of Littlewood and Offord
-
P. Erdos, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945) 898-902.
-
(1945)
Bull. Amer. Math. Soc
, vol.51
, pp. 898-902
-
-
Erdos, P.1
-
7
-
-
0012869144
-
On the Kolmogorov-Rogozin inequality for the concentration function, Z. Wahrscheinlichkeitstheorie et Verw
-
C. G. Esséen, On the Kolmogorov-Rogozin inequality for the concentration function, Z. Wahrscheinlichkeitstheorie et Verw. Gebiete 5 (1966) 210-216.
-
(1966)
Gebiete
, vol.5
, pp. 210-216
-
-
Esséen, C.G.1
-
8
-
-
51249182622
-
The eigenvalues of random symmetric matrices
-
Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1(3) (1981) 233-241.
-
(1981)
Combinatorica
, vol.1
, Issue.3
, pp. 233-241
-
-
Füredi, Z.1
Komlós, J.2
-
10
-
-
44249096503
-
The strong circular law. Twenty years later. II
-
255-312
-
V. L. Girko, The strong circular law. Twenty years later. II, Random Oper. Stochastic Equations 12(3) (2004) 255-312.
-
(2004)
Random Oper. Stochastic Equations
, vol.12
, Issue.3
-
-
Girko, V.L.1
-
12
-
-
44249116809
-
The circular law for random matrices
-
preprint
-
F. Götze and A. N. Tikhomirov, The circular law for random matrices, preprint.
-
-
-
Götze, F.1
Tikhomirov, A.N.2
-
13
-
-
0001703129
-
Statistical ensembles of complex, quaternion, and real matrices
-
J. Ginibre, Statistical ensembles of complex, quaternion, and real matrices, J. Math. Phys. 6 (1965) 440-449.
-
(1965)
J. Math. Phys
, vol.6
, pp. 440-449
-
-
Ginibre, J.1
-
14
-
-
44249112035
-
-
C. R. Hwang, A brief survey on the spectral radius and the spectral distribution of large dimensional random matrices with i.i.d. entries, in Random Matrices and Applications, ed. M. L. Mehta (Amer. Math. Soc., Providence, RI, 1986), pp. 145-152.
-
C. R. Hwang, A brief survey on the spectral radius and the spectral distribution of large dimensional random matrices with i.i.d. entries, in Random Matrices and Applications, ed. M. L. Mehta (Amer. Math. Soc., Providence, RI, 1986), pp. 145-152.
-
-
-
-
15
-
-
84968494236
-
On the probability that a random ±1 matrix is singular
-
J. Kahn, J. Komlós and E. Szemerédi, On the probability that a random ±1 matrix is singular, J. Amer. Math. Soc. 8 (1995) 223-240.
-
(1995)
J. Amer. Math. Soc
, vol.8
, pp. 223-240
-
-
Kahn, J.1
Komlós, J.2
Szemerédi, E.3
-
16
-
-
18644382839
-
Smallest singular value of random matrices and geometry of random polytopes
-
A. Litvak, A. Pajor, M. Rudelson and N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195(2) (2005) 491-523.
-
(2005)
Adv. Math
, vol.195
, Issue.2
, pp. 491-523
-
-
Litvak, A.1
Pajor, A.2
Rudelson, M.3
Tomczak-Jaegermann, N.4
-
17
-
-
0005272276
-
On the number of real roots of a random algebraic equation III
-
J. Littlewood and C. Offord, On the number of real roots of a random algebraic equation III, Mat. Sbornik 12 (1943) 277-285.
-
(1943)
Mat. Sbornik
, vol.12
, pp. 277-285
-
-
Littlewood, J.1
Offord, C.2
-
19
-
-
44249093177
-
Circular law: Extreme singular values and potential theory
-
preprint
-
G. Pan and W. Zhou, Circular law: Extreme singular values and potential theory, preprint.
-
-
-
Pan, G.1
Zhou, W.2
-
20
-
-
38049012049
-
Invertibility of random matrices: Norm of the inverse
-
to appear in
-
M. Rudelson, Invertibility of random matrices: Norm of the inverse, to appear in Ann. Math.
-
Ann. Math
-
-
Rudelson, M.1
-
21
-
-
36048939277
-
The Littlewood-Offord problem and the condition number of random matrices
-
preprint
-
M. Rudelson and R. Vershynin, The Littlewood-Offord problem and the condition number of random matrices, preprint.
-
-
-
Rudelson, M.1
Vershynin, R.2
-
22
-
-
35448958033
-
Smoothed analysis of the condition numbers and growth factors of matrices
-
preprint
-
A. Sankar, S. H. Teng and D. A. Spielman, Smoothed analysis of the condition numbers and growth factors of matrices, preprint.
-
-
-
Sankar, A.1
Teng, S.H.2
Spielman, D.A.3
-
23
-
-
35248849703
-
Smoothed analysis of algorithms
-
ed. T. Li, Higher Ed. Press, Beijing
-
D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms, in Proc. Int. Congress of Mathematicians (Beijing, 2002), ed. T. Li, Vol. 1 (Higher Ed. Press, Beijing, 2002), pp. 597-606.
-
(2002)
Proc. Int. Congress of Mathematicians (Beijing, 2002)
, vol.1
, pp. 597-606
-
-
Spielman, D.A.1
Teng, S.H.2
-
24
-
-
4243066295
-
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
-
D. A. Spielman and S. H. Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, J. ACM 51(3) (2004) 385-463.
-
(2004)
J. ACM
, vol.51
, Issue.3
, pp. 385-463
-
-
Spielman, D.A.1
Teng, S.H.2
-
26
-
-
33645288547
-
On random ±1 matrices: Singularity and determinant
-
T. Tao and V. Vu, On random ±1 matrices: Singularity and determinant, Random Structures Algorithms 28(1) (2006) 1-23.
-
(2006)
Random Structures Algorithms
, vol.28
, Issue.1
, pp. 1-23
-
-
Tao, T.1
Vu, V.2
-
27
-
-
35448946399
-
Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
-
to appear in
-
T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, to appear in Ann. Math.
-
Ann. Math
-
-
Tao, T.1
Vu, V.2
-
28
-
-
35448941880
-
The condition number of a randomly perturbed matrix
-
California, USA
-
T. Tao and V. Vu, The condition number of a randomly perturbed matrix, in Proc. 39th Annual ACM Symposium on Theory of Computing, STOC 2007, California, USA (2007), pp. 248-255.
-
(2007)
Proc. 39th Annual ACM Symposium on Theory of Computing, STOC 2007
, pp. 248-255
-
-
Tao, T.1
Vu, V.2
-
29
-
-
48949102370
-
John-type theorems for generalized arithmetic progressions and iterated sumsets
-
to appear in
-
T. Tao and V. Vu, John-type theorems for generalized arithmetic progressions and iterated sumsets, to appear in Adv. Math.
-
Adv. Math
-
-
Tao, T.1
Vu, V.2
-
30
-
-
44249113979
-
-
V. Vu, Spectral norm of random matrices, to appear in Combinatrica; A extended abstract was published in Proc. 37th Annual ACM Symposium on Theory of Computing, STOC 2005, Baltimore, USA (2005), pp. 423-430.
-
V. Vu, Spectral norm of random matrices, to appear in Combinatrica; A extended abstract was published in Proc. 37th Annual ACM Symposium on Theory of Computing, STOC 2005, Baltimore, USA (2005), pp. 423-430.
-
-
-
|