The least singular value of R*XT + U*YV, after scaling by N, converges in distribution to 1 - e^{-r^2}, the same limit as for a complex Gaussian matrix.
Spectral Statistics of Sparse Random Graphs with a General Degree Distribution
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive integer. We prove that the distribution of eigenvalues is given by the solution of a functional self-consistent equation. We prove a local law down to the optimal scale and prove bulk universality. The results are parallel to \cite{Erdos2013b} and \cite{Landon2015}.
fields
math.PR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Universality of the least singular value for the sum of random matrices
The least singular value of R*XT + U*YV, after scaling by N, converges in distribution to 1 - e^{-r^2}, the same limit as for a complex Gaussian matrix.