English

On the Largest and the Smallest Singular Value of Sparse Rectangular Random Matrices

Probability 2022-11-29 v3

Abstract

We derive estimates for the largest and smallest singular values of sparse rectangular N×nN\times n random matrices, assuming limN,nnN=y(0,1)\lim_{N,n\to\infty}\frac nN=y\in(0,1). We consider a model with sparsity parameter pNp_N such that NpNlogαNNp_N\sim \log^{\alpha }N for some α>1\alpha>1, and assume that the moments of the matrix elements satisfy the condition EXjk4+δC<\mathbf E|X_{jk}|^{4+\delta}\le C<\infty. We assume also that the entries of matrices we consider are truncated at the level (NpN)12ϰ(Np_N)^{\frac12-\varkappa} with ϰ:=δ2(4+δ)\varkappa:=\frac{\delta}{2(4+\delta)}.

Keywords

Cite

@article{arxiv.2207.03155,
  title  = {On the Largest and the Smallest Singular Value of Sparse Rectangular Random Matrices},
  author = {F. Götze and A. Tikhomirov},
  journal= {arXiv preprint arXiv:2207.03155},
  year   = {2022}
}

Comments

arXiv admin note: text overlap with arXiv:0802.3956 by other authors

R2 v1 2026-06-24T12:16:56.598Z