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

Abstract

We derive estimates for the largest and smallest singular values of sparse rectangular N× n random matrices, assuming N,n∞ nN=y∈(0,1). We consider a model with sparsity parameter pN such that NpN α N for some α>1, and assume that the moments of the matrix elements satisfy the condition E|Xjk|4+δ C<∞. We assume also that the entries of matrices we consider are truncated at the level (NpN)12- with :=δ2(4+δ).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…