Related papers: The average singular value of a complex random mat…

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

We study the large $N$ limit of a sparse random block matrix ensemble. It depends on two parameters: the average connectivity $Z$ and the size of the blocks $d$, which is the dimension of an euclidean space. In the limit of large $d$, with…

We consider the singular values of certain Young diagram shaped random matrices. For block-shaped random matrices, the empirical distribution of the squares of the singular eigenvalues converges almost surely to a distribution whose moments…

We introduce the $N\times N$ random matrices $$ X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables}, $$ and $d$ a…

We study the limiting spectral distribution of large-dimensional sample covariance matrices associated with symmetric random tensors formed by $\binom{n}{d}$ different products of $d$ variables chosen from $n$ independent standardized…

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

The singular value decomposition (SVD) and the principal component analysis are fundamental tools and probably the most popular methods for data dimension reduction. The rapid growth in the size of data matrices has lead to a need for…

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

Concatenating matrices is a common technique for uncovering shared structures in data through singular value decomposition (SVD) and low-rank approximations. The fundamental question arises: How does the singular value spectrum of the…

We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in (C^d)^{otimes k}, where k and p/d^k are fixed while d grows. When k=1,…

We prove that the squared singular values of a fixed matrix multiplied with a truncation of a Haar distributed unitary matrix are distributed by a polynomial ensemble. This result is applied to a multiplication of a truncated unitary matrix…

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…

In this paper we compute the leading terms in the sum of the $k^{th}$ power of the roots of $L_{p}^{(\alpha)}$, the Laguerre-polynomial of degree $p$ with parameter $\alpha$. The connection between the Laguerre-polynomials and the…

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…