The sparse circular law under minimal assumptions
Mark Rudelson, Konstantin Tikhomirov

TL;DR
This paper proves the circular law for eigenvalues of certain random matrices with Bernoulli entries under minimal assumptions, specifically when the average number of non-zero entries per row grows to infinity.
Contribution
It establishes the circular law for matrices with Bernoulli entries under the minimal condition that the expected number of non-zero entries per row tends to infinity.
Findings
Circular law holds under minimal assumptions on Bernoulli random matrices.
Eigenvalue distribution converges to uniform measure on the unit disc.
Results extend the applicability of the circular law to sparser matrices.
Abstract
The circular law asserts that the empirical distribution of eigenvalues of appropriately normalized matrix with i.i.d. entries converges to the uniform measure on the unit disc as the dimension grows to infinity. Consider an matrix , where are copies of a real random variable of unit variance, variables are Bernoulli () with , and and , , are jointly independent. In order for the circular law to hold for the sequence , one has to assume that . We derive the circular law under this minimal assumption.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Point processes and geometric inequalities · Stochastic processes and statistical mechanics
