Random n by n matrix (with 4 moments of entries Gaussian) has (2n/pi)^(1/2)+o(n^(1/2)) real eigenvalues

You need to know: Know: n \times n matrix with real entries, eigenvalues, probability, random variable, jointly independent random variables, standard normal distribution, notation E for expectation, almost sure convergence, small o notation.

Background: For positive integer n, let M_n be n \times n matrix whose entries \xi_{ij} are jointly independent real random variables which (i) have exponential decay, i.e., P(|\xi_{ij}|\geq t) \leq C \exp(-t^c) for some constants C,c>0 (independent of n) and all i,j, and (ii) E[\xi_{ij}^k]=E[Z^k] for k=1,2,3,4 and all i,j, where Z is the random variable having standard normal distribution.

The Theorem: On 9th June 2012, Terence Tao and Van Vu submitted to arxiv a paper in which they proved that M_n has \sqrt{\frac{2n}{\pi}}+o(\sqrt{n}) real eigenvalues asymptotically almost surely.

Short context: The study of eigenvalues of large random matrices is one of the central themes in probability theory. The Theorem estimates how many of the eigenvalues are real. Earlier, this result was known to hold only for the special case when all \xi_{ij} has standard normal distribution. In fact, the Theorem is just one out of many corollaries of a much more general theorem, which, very roughly speaking, states that many properties of the eigenvalues of a random matrix with independent entries depend only on the first four moments of the entries. Unlike previous results in the literature, this theorem does not require matrix M_n to be symmetric. It also does not require entries \xi_{ij} to be identically distributed.

Links: Free arxiv version of the original paper is here, journal version is here.

Go to the list of all theorems

One thought on “Random n by n matrix (with 4 moments of entries Gaussian) has (2n/pi)^(1/2)+o(n^(1/2)) real eigenvalues

Leave a comment