2009
DOI: 10.1017/cbo9780511801334
|View full text |Cite
|
Sign up to set email alerts
|

An Introduction to Random Matrices

Abstract: The theory of random matrices plays an important role in many areas of pure mathematics and employs a variety of sophisticated mathematical tools (analytical, probabilistic and combinatorial). This diverse array of tools, while attesting to the vitality of the field, presents several formidable obstacles to the newcomer, and even the expert probabilist. This rigorous introduction to the basic theory is sufficiently self-contained to be accessible to graduate students in mathematics or related sciences, who hav… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

27
2,298
0
11

Year Published

2013
2013
2018
2018

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 1,151 publications
(2,336 citation statements)
references
References 308 publications
(285 reference statements)
27
2,298
0
11
Order By: Relevance
“…On the other hand, applying Theorem 3.2 with d 1 = d 2 = 4 immediately yields the analogous bound for X (1) . We therefore finally obtain…”
Section: Slicingmentioning
confidence: 74%
“…On the other hand, applying Theorem 3.2 with d 1 = d 2 = 4 immediately yields the analogous bound for X (1) . We therefore finally obtain…”
Section: Slicingmentioning
confidence: 74%
“…Furthermore it can be deduced from [31], [32], [34] and [4] (see also [2,Exercise 3.9.36]) that the asymptotics for F β (x) as x → ∞, for β = 1, 2 or 4 is,…”
Section: Tracy-widom Distributions 21 Classical Tracy-widom Distribumentioning
confidence: 99%
“…where k N,β is a non negative constant and for β = 1, 2 or 4, it can be computed by Selberg's Integral formula (see [2,Theorem 2.5.8]). The PDF (1) exhibits strong dependence of the eigenvalues of the G(O/U/S)E ensembles.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is known that if we take a matrix A=randn(m,n) (in MATLAB notation), which is an m × n random matrix with . Thus if we have a correlation matrix with eigenvalues larger than (1 + √ r) 2 we consider these as signal rather than noise. Theoretical understanding of the "signal" eigenvalues may be found in [19].…”
mentioning
confidence: 99%