Файл:CircleLaw.pngPlot of the real and imaginary parts (scaled by sqrt(1000)) of the eigenvalues of a 1000x1000 matrix with independent, standard normal entries.
Let <math>(X_n)_{n=1}^\infty</math> be a sequence of Шаблон:Math matrix ensembles whose entries are i.i.d. copies of a complex random variable Шаблон:Math with mean 0 and variance 1. Let <math>\lambda_1, \ldots, \lambda_n, 1 \leq j \leq n</math> denote the eigenvalues of <math>\displaystyle \frac{1}{\sqrt{n}}X_n </math>. Define the empirical spectral measure of <math>\displaystyle \frac{1}{\sqrt{n}} X_n</math> as
<math> \mu_{\frac{1}{\sqrt{n}} X_n}(A) = n^{-1} \#\{j \leq n : \lambda_j \in A \}~, \quad A \in \mathcal{B}(\mathbb{C}).</math>
With these definitions in mind, the circular law asserts that almost surely (i.e. with probability one), the sequence of measures <math>\displaystyle \mu_{\frac{1}{\sqrt{n}} X_n}</math> converges in distribution to the uniform measure on the unit disk.
History
For random matrices with Gaussian distribution of entries (the Ginibre ensembles), the circular law was established in the 1960s by Jean Ginibre.[1] In the 1980s, Vyacheslav Girko introduced[2] an approach which allowed to establish the circular law for more general distributions. Further progress was made[3] by Zhidong Bai, who established the circular law under certain smoothness assumptions on the distribution.
The assumptions were further relaxed in the works of Terence Tao and Van H. Vu,[4] Guangming Pan and Wang Zhou,[5] and Friedrich Götze and Alexander Tikhomirov.[6] Finally, in 2010 Tao and Vu proved[7] the circular law under the minimal assumptions stated above.
The circular law result was extended in 1985 by Girko[8] to an elliptical law for ensembles of matrices with a fixed amount of correlation between the entries above and below the diagonal. The elliptic and circular laws were further generalized by Aceituno, Rogers and Schomerus to the hypotrochoid law which includes higher order correlations.[9]
