The circular law for sparse non-Hermitian matrices
Abstract
For a class of sparse random matrices of the form An =(i,jδi,j)i,j=1n, where \i,j\ are i.i.d.~centered sub-Gaussian random variables of unit variance, and \δi,j\ are i.i.d.~Bernoulli random variables taking value 1 with probability pn, we prove that the empirical spectral distribution of An/npn converges weakly to the circular law, in probability, for all pn such that pn=ω(2n/n). Additionally if pn satisfies the inequality npn > (c n) for some constant c, then the above convergence is shown to hold almost surely. The key to this is a new bound on the smallest singular value of complex shifts of real valued sparse random matrices. The circular law limit also extends to the adjacency matrix of a directed Erdos-R\'enyi graph with edge connectivity probability pn.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.