Welcome to MathOverflow

Question

0

Suppose we have a matrix $A_n = \frac{1}{n}\sum_{i=1}^nX_i X_i^T$, where $X_i$ is a $p$-dimensional random-vector. We also know that $E(XX^T) = \Sigma_{p \times p}$. Let us denote the $j$-th largest eigenvalue of a symmetric positive-definite matrix $M$ by $\lambda_j(M)$. Then can we say anything about convergence of $\lambda_j(A_n) \rightarrow \lambda_j(\Sigma)$ as $n \rightarrow \infty$, that is, whether it converges in probability or in distribution and if so can we characterize the rate of convergence.

Thanks a lot, any help is much appreciated.

Best Ashin

edited Dec 15 2011 at 16:57

asked Dec 14 2011 at 18:42

Ashin
33●3

Do you mean $A_n = \frac{1}{n} \sum_{i=1}^n X_i X_i^T$? Also, presumably the $X_i$ are independent. – Robert Israel Dec 14 2011 at 18:51

2

There's a lot of literature on this problem. I suggest starting by taking a look at this paper: www-personal.umich.edu/~romanv/papers/… and other recent papers by Roman Vershynin. – Mark Meckes Dec 14 2011 at 19:28

@ Robert : Yes I do mean $A_n = \frac{1}{n}\sum_{i = 1}^{n}X_i X_i^T$. Sorry about the typo. – Ashin Dec 14 2011 at 19:59

@Ashin: then perhaps you should edit the question accordingly. – Ori Gurel-Gurevich Dec 15 2011 at 0:45

Shahrooz · Answer 1 · 2011-12-14 20:41:43Z UTC

1

I think this book is suitable for further study about this question:

"Representation Theory of Finite Groups An Introductory Approach" "Benjamin Steinberg"

This book has some chapters related to your question.

edited Dec 14 2011 at 20:41

answered Dec 14 2011 at 20:32

Shahrooz
972●1●2●13

Convergence of Eigenvalues

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

1 Answer

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.