Related papers: Kronecker-product random matrices and a matrix lea…
Tensor Kronecker products, the natural generalization of the matrix Kronecker product, are independently emerging in multiple research communities. Like their matrix counterpart, the tensor generalization gives structure for implicit…
We study the resolvent \[ G^z = \left(\frac{1}{n}XX^T - zI_p\right)^{-1}, \qquad z\in\mathbb C,\ \Im(z)>0, \] where $X=(x_1,\ldots,x_n)\in\mathcal M_{p,n}$ is a random matrix with independent, but not necessarily identically distributed,…
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 consider large non-Hermitian $N\times N$ matrices with an additive independent, identically distributed (i.i.d.) noise for each matrix elements. We show that already a small noise of variance $1/N$ completely thermalises the bulk…
We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ in which the upper triangular entries are independent identically distributed random variables with mean zero and unit variance. We additionally suppose that $\mathbb E…
We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…
We pose the problem of approximating optimally a given nonnegative signal with the scalar autoconvolution of a nonnegative signal. The I-divergence is chosen as the optimality criterion being well suited to incorporate nonnegativity…
Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by…
Based on sketching techniques, we propose two randomized algorithms for tensor ring (TR) decomposition. Specifically, by defining new tensor products and investigating their properties, we apply the Kronecker sub-sampled randomized Fourier…
We investigate the fluctuations around the mean of the Stieltjes transform of the empirical spectral distribution of any selfadjoint noncommutative polynomial in a Wigner matrix and a deterministic diagonal matrix. We obtain the convergence…
We study the lower tail behavior of the least singular value of an $n\times n$ random matrix $M_n := M+N_n$, where $M$ is a fixed complex matrix with operator norm at most $\exp(n^{c})$ and $N_n$ is a random matrix, each of whose entries is…
In this paper, we consider the interference rejection combining (IRC) receiver, which improves the cell-edge user throughput via suppressing inter-cell interference and requires estimating the covariance matrix including the inter-cell…
We study two inexact methods for solutions of random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric matrix operator, the methods solve for eigenvalues and…
Given an $n\times n$ matrix $A_n$ and $1\leq r, p \leq\infty$, consider the following quadratic optimization problem referred to as the $\ell_r$-Grothendieck problem:…
A matrix completion problem is to recover the missing entries in a partially observed matrix. Most of the existing matrix completion methods assume a low rank structure of the underlying complete matrix. In this paper, we introduce an…
In this article, we propose an algorithm for approximating the action of $\varphi-$functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum…
In this paper, we show that the time complexity of monotone min-plus product of two $n\times n$ matrices is $\tilde{O}(n^{(3+\omega)/2})=\tilde{O}(n^{2.687})$, where $\omega < 2.373$ is the fast matrix multiplication exponent [Alman and…
We propose a test for a covariance matrix to have Kronecker Product Structure (KPS). KPS implies a reduced rank restriction on a certain transformation of the covariance matrix and the new procedure is an adaptation of the Kleibergen and…
The decomposition or approximation of a linear operator on a matrix space as a sum of Kronecker products plays an important role in matrix equations and low-rank modeling. The approximation problem in Frobenius norm admits a well-known…
Suppose $X$ is an $N \times n$ complex matrix whose entries are centered, independent, and identically distributed random variables with variance $1/n$ and whose fourth moment is of order ${\mathcal O}(n^{-2})$. In the first part of the…