Extreme singular values of inhomogeneous sparse random rectangular matrices
arXiv:2209.12271 · doi:10.3150/23-BEJ1699
Abstract
We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a bipartite block structure. We obtain probabilistic upper (respectively, lower) bounds for the largest (respectively, smallest) singular values of a large rectangular random matrix . These bounds are given in terms of the maximal and minimal -norms of the rows and columns of the variance profile of . The proofs involve finding probabilistic upper bounds on the spectral radius of an associated non-backtracking matrix . The two-sided bounds can be applied to the centered adjacency matrix of sparse inhomogeneous Erdős-Rényi bipartite graphs for a wide range of sparsity, down to criticality. In particular, for Erdős-Rényi bipartite graphs with , and , our sharp bounds imply that there are no outliers outside the support of the Marčenko-Pastur law almost surely. This result extends the Bai-Yin theorem to sparse rectangular random matrices.
23 pages
References in corpus (16)
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- The dimension-free structure of nonhomogeneous random matrices
- On the spectral norm of Gaussian random matrices
- Matrix Concentration Inequalities and Free Probability
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- -Spread and Restricted Isometry Properties of Sparse Random Matrices
- Graph Zeta Function in the Bethe Free Energy and Loopy Belief Propagation
- Almost sure convergence of the largest and smallest eigenvalues of high-dimensional sample correlation matrices
- Spectral Thresholds in the Bipartite Stochastic Block Model
- On the convergence of the extremal eigenvalues of empirical covariance matrices with dependence
- A Graphon Approach to Limiting Spectral Distributions of Wigner-type Matrices
- Eigenvalues of the non-backtracking operator detached from the bulk
- A class of network models recoverable by spectral clustering
- Spectra of random regular hypergraphs
- On the second eigenvalue of random bipartite biregular graphs
- Universality and sharp matrix concentration inequalities