English

The circular law for sparse non-Hermitian matrices

Probability 2018-06-13 v2

Abstract

For a class of sparse random matrices of the form An=(ξi,jδi,j)i,j=1nA_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n, where {ξi,j}\{\xi_{i,j}\} are i.i.d.~centered sub-Gaussian random variables of unit variance, and {δi,j}\{\delta_{i,j}\} are i.i.d.~Bernoulli random variables taking value 11 with probability pnp_n, we prove that the empirical spectral distribution of An/npnA_n/\sqrt{np_n} converges weakly to the circular law, in probability, for all pnp_n such that pn=ω(log2n/n)p_n=\omega({\log^2n}/{n}). Additionally if pnp_n satisfies the inequality npn>exp(clogn)np_n > \exp(c\sqrt{\log n}) for some constant cc, 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 Erd\H{o}s-R\'{e}nyi graph with edge connectivity probability pnp_n.

Keywords

Cite

@article{arxiv.1707.03675,
  title  = {The circular law for sparse non-Hermitian matrices},
  author = {Anirban Basak and Mark Rudelson},
  journal= {arXiv preprint arXiv:1707.03675},
  year   = {2018}
}

Comments

55 pages, Section 9 shortened, presentation improved, proof of Theorem 1.7 is removed from this version. For its proof we refer the reader to V1

R2 v1 2026-06-22T20:44:40.359Z