Related papers: On the real Davies' conjecture
We derive the probability that all eigenvalues of a random matrix $\bf M$ lie within an arbitrary interval $[a,b]$, $\psi(a,b)\triangleq\Pr\{a\leq\lambda_{\min}({\bf M}), \lambda_{\max}({\bf M})\leq b\}$, when $\bf M$ is a real or complex…
Let $A$ be an isotropic, sub-gaussian $m \times n$ matrix. We prove that the process $Z_x := \|Ax\|_2 - \sqrt m \|x\|_2$ has sub-gaussian increments. Using this, we show that for any bounded set $T \subseteq \mathbb{R}^n$, the deviation of…
Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…
We establish the following universality property in high dimensions: Let $X$ be a random vector with density in $\mathbb{R}^n$. The density function can be arbitrary. We show that there exists a fixed unit vector $\theta \in \mathbb{R}^n$…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…
In statistics and machine learning, people are often interested in the eigenvectors (or singular vectors) of certain matrices (e.g. covariance matrices, data matrices, etc). However, those matrices are usually perturbed by noises or…
We consider a constant-size subset of left and right eigenvectors of an $N\times N$ i.i.d. complex non-Hermitian matrix associated with the eigenvalues with pairwise distances at least $N^{-\frac12+\epsilon}$. We show that arbitrary…
This is the fifth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…
An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\eta \geq 0$, $\Pr(s_n(M_n)…
In this paper, we show that the largest and smallest eigenvalues of a sample correlation matrix stemming from $n$ independent observations of a $p$-dimensional time series with iid components converge almost surely to $(1+\sqrt{\gamma})^2$…
Let $A$ be an $N\times n$ random matrix whose entries are coordinates of an isotropic log-concave random vector in $\mathbb{R}^{Nn}$. We prove sharp lower tail estimates for the smallest singular value of $A$ in the following cases: (1)…
Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…
Let $A \in \mathbb{R}^{N \times n}$ ($N \geq n$) be a random matrix with with independent entries that have mean 0 variance 1 and bounded $2+\beta$ moment. We show that the smallest singular value $\sigma_n(A)$ satisfies \[ \Pr…
An explicit Dirichlet series is obtained, which represents an analytic function of $s$ in the half-plane $\Re s>1/2$ except for having simple poles at points $s_j$ that correspond to exceptional eigenvalues $\lambda_j$ of the non-Euclidean…
Williamson's theorem states that for any $2n \times 2n$ real positive definite matrix $A$, there exists a $2n \times 2n$ real symplectic matrix $S$ such that $S^TAS=D \oplus D$, where $D$ is an $n\times n$ diagonal matrix with positive…
Litvak (2018) conjectured that, for any $p > 0$, the quantity $\mathbb{E}[\min_{i = 1}^n |g_i|^p]$ where $g \sim \mathcal{N}(0, \Sigma)$ is a centered Gaussian random vector is minimized among $n \times n$ correlation matrices $\Sigma$ by…
We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…
We establish a moderate deviation principle (MDP) for the number of eigenvalues of a Wigner matrix in an interval close to the edge of the spectrum. Moreover we prove a MDP for the $i$th largest eigenvalue close to the edge. The proof…
It is shown that certain ensembles of random matrices with entries that vanish outside a band around the diagonal satisfy a localization condition on the resolvent which guarantees that eigenvectors have strong overlap with a vanishing…
Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $…