English

Universality of the least singular value for sparse random matrices

Probability 2019-01-25 v2

Abstract

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of N×NN\times N matrices whose entries are chosen independently from a Bernoulli distribution with parameter pp. These matrices represent the adjacency matrices of random Erd\H{o}s--R\'enyi digraphs and are sparse when p1p\ll 1. We prove that in the regime pN1pN\gg 1, the distribution of the least singular value is universal in the sense that it is independent of pp and equal to the distribution of the least singular value of a Gaussian matrix ensemble. We also prove the universality of the joint distribution of multiple small singular values. Our methods extend to matrix ensembles whose entries are chosen from arbitrary distributions that may be correlated, complex valued, and have unequal variances.

Keywords

Cite

@article{arxiv.1711.00580,
  title  = {Universality of the least singular value for sparse random matrices},
  author = {Ziliang Che and Patrick Lopatto},
  journal= {arXiv preprint arXiv:1711.00580},
  year   = {2019}
}

Comments

53 pages, minor revisions

R2 v1 2026-06-22T22:33:38.605Z