RANDOM MATRICES: THE CIRCULAR LAW

From MaRDI portal
Publication:3521637



Abstract: Let a be a complex random variable with mean zero and bounded variance sigma2. Let Nn be a random matrix of order n with entries being i.i.d. copies of a. Let lambda1,...,lambdan be the eigenvalues of frac1sigmasqrtnNn. Define the empirical spectral distribution mun of Nn by the formula mu_n(s,t) := frac{1}{n} # {k leq n| Re(lambda_k) leq s; Im(lambda_k) leq t }. The Circular law conjecture asserts that mun converges to the uniform distribution muinfty over the unit disk as n tends to infinity. We prove this conjecture under the slightly stronger assumption that the (2+eta)h-moment of a is bounded, for any eta>0. Our method builds and improves upon earlier work of Girko, Bai, G"otze-Tikhomirov, and Pan-Zhou, and also applies for sparse random matrices. The new key ingredient in the paper is a general result about the least singular value of random matrices, which was obtained using tools and ideas from additive combinatorics.





Cited in
(only showing first 100 items - show all)








This page was built for publication: RANDOM MATRICES: THE CIRCULAR LAW

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521637)