Universality of the least singular value for sparse random matrices
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× N matrices whose entries are chosen independently from a Bernoulli distribution with parameter p. These matrices represent the adjacency matrices of random Erdos--R\'enyi digraphs and are sparse when p 1. We prove that in the regime pN 1, the distribution of the least singular value is universal in the sense that it is independent of p 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.
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.