2016
DOI: 10.1016/j.crma.2015.12.008
|View full text |Cite
|
Sign up to set email alerts
|

A short proof of the Marchenko–Pastur theorem

Abstract: We prove the Marchenko-Pastur theorem for random matrices with i.i.d. rows and a general dependence structure within the rows by a simple modification of the standard Cauchy-Stieltjes resolvent method.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 12 publications
(8 reference statements)
0
12
0
1
Order By: Relevance
“…, p, are entries of x pk . The latter can be checked directly as in the proof of Proposition 2.1 in [22].…”
Section: Consider the Following Assumptionsmentioning
confidence: 92%
See 2 more Smart Citations
“…, p, are entries of x pk . The latter can be checked directly as in the proof of Proposition 2.1 in [22].…”
Section: Consider the Following Assumptionsmentioning
confidence: 92%
“…It is proved in [22] (see also Lemma 4.3 in Section 4) that if each x p has independent entries with mean zero and unit variance, then (A1) is equivalent to the Lindeberg condition (2).…”
Section: Consider the Following Assumptionsmentioning
confidence: 99%
See 1 more Smart Citation
“…To bound P 2 , recall from Yaskov (2016) that for a real, symmetric, positive semidefinite m × m matrix M ; x ∈ R m , z ∈ C + the following inequality holds:…”
Section: Proof Of Theorem 21mentioning
confidence: 99%
“…Sistemde M adet BR kullanıcısı olduğu ve N adet işaret örneği alındığı varsayımı ile y(n) matrisi MxN boyutunda olacaktır. (Yaskov, 2016…”
Section: Adaptif Eşik Değerinin Belirlenmesiunclassified