Skip to main content

All Questions

Filter by
Sorted by
Tagged with
32 votes
3 answers
12k views

What is the Katz-Sarnak philosophy?

It has been recently mentioned by a speaker (his talk is completely not relevant to random matrix theory/RMT though) that modern statistics, especially random matrices theory, will help solving some ...
Henry.L's user avatar
  • 8,071
25 votes
1 answer
4k views

What kind of random matrices have rapidly decaying singular values?

I've been told that in machine learning it's common to compute the singular value decomposition of matrices in order to throw out all information in the matrix except that corresponding to, say, the $...
Qiaochu Yuan's user avatar
22 votes
1 answer
1k views

Random distance matrices

My question is motivated by the following recent paper: Gadgil, Siddhartha; Krishnapur, Manjunath, Lipschitz correspondence between metric measure spaces and random distance matrices, Int. Math. Res. ...
ght's user avatar
  • 3,626
20 votes
0 answers
3k views
+200

What does a product of many Gaussian matrices converge to?

Let $A$ be a product of $n$ $d\times d$ matrices with IID standard Gaussian entries and consider the value of $g(x)=x f(x)$ where $f(x)$ is the density of squared singular values of $A/\|A\|$. Is ...
Yaroslav Bulatov's user avatar
18 votes
1 answer
1k views

How fast can extreme eigenvalues of the average of random matrices converge to their expectation?

Suppose that $X_1,X_2,\ldots,X_m$ are independent $d\times d$ random matrices and let $\overline{X} := \frac{1}{m}\sum_{i=1}^m X_i$. One of the questions studied under the theory of random matrices is ...
sbahmani's user avatar
  • 181
10 votes
4 answers
645 views

Expected value of Bernoulli quadratic forms

Let $\mathbf{Y}\in\mathbb{R}^{n\times n}$ be a symmetric matrix. Let $\mathbf{x}\in\mathbb{R}^n$ be random vectors with entries i.i.d. $\pm 1$ with equal probability. I'm interested in a lower bound ...
Anahita's user avatar
  • 363
8 votes
2 answers
547 views

Concentration inequality for minimal eigenvalue of sample covariance

I was reading an article of matrix completion and met the following lemma The concentration inequality for $\sigma_{\max}$ part is a standard result. However, I didn't find any results like the $\...
aurora_borealis's user avatar
8 votes
1 answer
2k views

Eigenvalue distributions of finite dimensional Wishart matrices

I am trying to obtain the eigenvalue distribution of a finite dimensional Wishart matrix. Let $A_{n\times n}\sim\mathbb{W}(\Sigma_{n\times n},m)$ where $\mathbb{W}(\Sigma_{n\times n},m)$ denotes the ...
user avatar
7 votes
1 answer
295 views

Closure of random rotations

Are matrix Fisher random variables closed under multiplication? For those unfamiliar with the jargon, let me unpack the terms above and repose my question. This is a question about probability ...
Bill Bradley's user avatar
  • 3,979
7 votes
0 answers
179 views

Can one "smooth over" k-wise independence to get actual independence?

I came across the following toy problem and was curious if there was a simple solution or counterexample. Suppose you have a distribution $p$ on $m$ random variables $X_1, \ldots, X_m$, each with ...
untitled459's user avatar
6 votes
1 answer
274 views

Spectrum asymptotics for a product of $k$ random matrices?

How does the spectrum of a product of $k$ random matrices behave around 0? In particular, I'm wondering if the CDF of squared singular values behaves as $x^{\frac{1}{k+1}}$ around 0. The result for $k=...
Yaroslav Bulatov's user avatar
6 votes
1 answer
1k views

Largest eigenvalues of a (random) correlation matrix?

I am recently studying on eigenvalues of a (random) correltion matrix. For a $N\times N$ correlation matrix (with a given meaning of randomness), its (1st, 2nd, etc.) eigenvalues have some ...
JJJZZZZZ's user avatar
  • 380
6 votes
0 answers
295 views

Dimension-free sample complexity for estimating Gaussian covariance

(also asked on math.se, with no answers) Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$: $$...
Yaroslav Bulatov's user avatar
6 votes
0 answers
554 views

a variation on Hanson-Wright inequality

The classic Hanson-Wright inequality states that for a Gaussian random vector $\mathbf{x}\in\mathbb{R}^n$ distributed as $\mathcal{N}(\mathbf{0},\mathbf{I})$ and $\mathbf{A}\in\mathbb{R}^{n\times n}$ ...
mohi's user avatar
  • 859
4 votes
1 answer
626 views

How to get the lower bound of the following $\tau$?

Let $A=\{a_{ij}\}_{1\le i,j\le n}$ be an $n$ by $n$ normalized Gaussian random matrix with $E[a_{ij}]=0$ and $E[a_{ij}^2]=1/n$. Ordering its eigenvalues by $\lambda_1\le \lambda_2\le \cdots \lambda_n$ ...
Hermi's user avatar
  • 288
4 votes
1 answer
485 views

Expected norms of Wishart matrices

Suppose $x_i \stackrel{\text{i.i.d}}{\sim} \mathcal{N}(\mu,\Sigma)$. What can we say about dependence on $b$ of Frobenius/spectral norm quantities below? $$f(b)=\left\|\frac{1}{b}\sum_{i=1}^b x_i x_i^...
Yaroslav Bulatov's user avatar
4 votes
1 answer
164 views

Limiting value of expectation of trace of exponential of Wishart matrix

Let $X$ be an $n \times d$ random matrix with iid entries from $N(0, 1/d)$. Let $S:=X^\top X/n$, a $d \times d$ Wishart matrix and let $T = e^{S} := \sum_{k=0}^\infty \dfrac{S^k}{k!}$ be its ...
dohmatob's user avatar
  • 6,853
4 votes
2 answers
1k views

Expectation of the trace of inverse of a Gaussian random matrix

Given a $N×M$ random complex gaussian matrix $X$ and $N×K$ random complex gaussian matrix $Y$ I'm interested in approximating the expectation expressed as: \begin{align} E[trace({(aX{X^H} + I)^{ - ...
hichem hb's user avatar
  • 377
4 votes
1 answer
304 views

Wishart type matrix

Assume a positive semi-definite $M\times M$ matrix $A$, not with full rank, and an $M\times N$ matrix $X$, where $M>N$. The elements of $X$ are independent, zero-mean complex Gaussian with variance ...
Nicki's user avatar
  • 129
4 votes
1 answer
294 views

Finding high-dimensional correlation matrices that are both sparse and low-rank

Let $\boldsymbol{R}$ be the correlation matrix of $X_i,i=1,\dots,p$ with a large $p\gg q=\text{rank}(\boldsymbol{R})$. Is that reasonable to assume that $\boldsymbol{R}$ is both (approximately) sparse ...
John's user avatar
  • 193
4 votes
1 answer
332 views

Asymptotic limit of trace of random matrix $(aI_m + WW^\top)^{-1}$, where $W$ has iid rows from $N(0,\Sigma)$

Let $m$ and $d$ be positive integers with $m,d \to \infty$ such that $m/d \to \rho \in (0,\infty)$. Let $W$ be a random $m \times d$ matrix with iid rows $w_1,\ldots,w_m \sim N(0,\Sigma)$ for a ...
dohmatob's user avatar
  • 6,853
4 votes
0 answers
75 views

Marginalization of Wishart distribution

Consider the following Wishart distribution $$ f({\bf W}) = \frac{ |{\bf W}|^{(n-p-1)/2} \exp\big[-\frac{1}{2}\text{tr}({\bf V}^{-1}{\bf W} ) \big] }{2^{np/2} |{\bf V}| \Gamma_p(\frac{n}{2})} \tag{1} $...
RenatoRenatoRenato's user avatar
4 votes
0 answers
638 views

Comparison of concentrations of different $L^p$-norms of (sub) Gaussian distributions

It's well-known that the Euclidean $2$-norm of subgaussian random vectors concentrates in high dimensions, e.g. when $X \sim \mathcal{N}(0,I_n),$ (or in general $X$ is subgaussian with independent co-...
Learning math's user avatar
4 votes
0 answers
970 views

Expected operator norm of inverse Wishart matrix

Let $ W\sim W_p(n,I)$ be a white $p\times p$ Wishart matrix, and assume $n>p+1$, which ensures that $W$ is invertible almost surely. Let $\|W^{-1}\|_{\text{op}}$ be the operator norm (maximum ...
mlopes's user avatar
  • 41
3 votes
1 answer
111 views

Distribution/moments of transformed normally distributed random vector

Let $\varepsilon \sim N\left ( 0,I_{k} \right )$, consider the following function of $\varepsilon$, $y=\left ( A+B\varepsilon \varepsilon {}'B{}' \right )^{^{\frac{1}{2}}}\varepsilon $, where $A$ is a ...
Zhizhan Zen 's user avatar
3 votes
2 answers
885 views

Expectation of product of random matrices

Let $X$ and $Y$ be independent random symmetric matrices. What can one say about $\mathbb{E} [X Y X Y]$ or $\mathrm{trace} \mathbb{E} [X Y X Y]$ in terms of properties of $X$ and $Y$? In particular, ...
alex's user avatar
  • 33
3 votes
2 answers
581 views

Largest eigenvalue of the adjacency matrix of weighted random graph

I find the theorem for largest eigenvalue of the adjacency matrix of ER random graph in here https://arxiv.org/pdf/math/0106066.pdf. The adjacency matrix is a symmetric random matrix s.t. diagonal ...
Tony's user avatar
  • 272
3 votes
1 answer
206 views

Asymptotic results for smallest gap of Gaussian random matrix

For a symmetric Gaussian random matrix $G=\{G\}_{1\le i,j \le n}$ with iid $E[G_{ij}]=0$ and $E[G_{ij}^2]=1/n$ (it is normalized), ordering its eigenvalues $\lambda_1\le \lambda_2\le\cdots \lambda_n$. ...
Hermi's user avatar
  • 288
3 votes
1 answer
845 views

Concentration inequality for the sample covariance matrix

I'd like to know if there is a concentration inequality for the sample covariance matrix that don't assume the knowledge of the true mean. Background. Given a probability distribution $\mu$ on $\...
Uzu Lim's user avatar
  • 903
3 votes
1 answer
711 views

Expectation of Mahalanobis norm

Let $(g_i)_{i=1,...,d}$ sampled i.i.d. from a standard Gaussian, and $(\lambda_i)_{i=1,...,d}$ non-random s.t. $\max_i(\lambda_i)=1$ and $\lambda_i>0, \forall i$. I am looking for the expectation ...
axk's user avatar
  • 517
3 votes
1 answer
902 views

Expectation of exponential of Gaussian random matrix

Let $X$ be an $(N, M)$ random Gaussian matrix where $M<N$. For a given vector $v$, I want to estimate the expectation of: \begin{align} E\left[ {{v^T}X{X^T}{v}} \right] \end{align} and \begin{align}...
hichem hb's user avatar
  • 377
3 votes
0 answers
131 views

Matrix-Gaussian distributions

The point of this question is to ask for references on matrix-variate Gaussian distributions. But I will explain what I mean by a matrix-variate Gaussian with an example (the notion I have in mind is ...
user3826143's user avatar
3 votes
0 answers
93 views

Explaning why the spectrum of a setting simple structure random matrix is always spiked ($d-1$ eigenvalues close to zero, and $1$ away from zero)

For concreteness, let $m=500$, $d=600$, $N=1000$. Let $W$ be and $d \times m$ matrix with unit-norm rows and let $u$ be a uni-norm vector of length $m$. Given a binary vector $b$ of length $m$, length ...
dohmatob's user avatar
  • 6,853
3 votes
1 answer
379 views

Concentration inequality for norm of solution to nonlinear least-squares problem

Define the piecewise-linear function $\psi(t):=\max(t,0)$ for all $t \in \mathbb R$. Let $d,n,k \to \infty$ at the same rate (i.e $n \asymp k \asymp d$). Let $y_1,\ldots,y_n \in \{-1,1\}$ uniformly ...
dohmatob's user avatar
  • 6,853
3 votes
0 answers
230 views

Expectation of angle between two vectors in the image of a gaussian random matrix

Let $m$ and $n$ be large positive integers (going to infinity), and let $W$ be a random matrix of size $n \times m$ with iid entries from $N(0,1/m)$. Let $x,y \in \mathbb R^m$ be deterministic vectors,...
dohmatob's user avatar
  • 6,853
3 votes
0 answers
58 views

Projection onto column space perturbed by Gaussian noise

Suppose we have a matrix $X\in\mathbb{R}^{m\times n}$ (with $n \le m$) with iid standard Gaussian entries, and suppose we have noise matrix $W\in\mathbb{R}^{m\times n}$ with iid Gaussian entries, but ...
Longti's user avatar
  • 141
3 votes
0 answers
307 views

Upper-bound for eigenvalues of $E [UU^T]$, where $U$ is uniformly distributed on the unit $n$-sphere

Let $X$ be a $\sigma$-subGaussian random vector on $\mathbb R^n$ (for large $n \ge 3$), meaning that the random variable $X^Tv$ is $\sigma$-subGaussian for every unit vector $v \in \mathbb R^n$. ...
dohmatob's user avatar
  • 6,853
3 votes
0 answers
151 views

Largest eigenvalue divided by $n$

Let $X$ be an $n\times n$ symmetric random matrix whose diagonal is fixed as $1$, and every element in the upper triangle (excluding the diagonal) is drawn from Bernoulli($p$). The elements in the ...
Tony's user avatar
  • 272
3 votes
0 answers
436 views

Rank of Hadamard product with random matrices

I do research in statistics and am not sure whether the following is considered research level or not in mathematics. If it isn't, I'm happy because that means the answer is probably known and I can ...
KOE's user avatar
  • 131
3 votes
0 answers
98 views

Asymptotic results on statistical graph models

This post is partly inspired by this post. Reference request: results on the asymptotic distribution of singular values related to a random orthogonal matrix While it is well-known that two basic ...
Henry.L's user avatar
  • 8,071
2 votes
1 answer
668 views

Lower-bound for smallest eigenvalue of random $k \times $k matrix $C(W)$ defined by $C(W)_{i,j} := 2(w_i^\top w_j)^2 + \|w_i\|^2\|w_j\|^2$

Let $k$ and $d$ be positive integers such that $d/k:=\lambda > 1$. Let $W$ be $k \times d$ random matrix with rows $w_1,\ldots,w_k \in \mathbb R^d$ drawn iid from $N(0,(1/d)I_d)$, and define the $k ...
dohmatob's user avatar
  • 6,853
2 votes
2 answers
303 views

Expectation of the determinant of the inverse of non-central Wishart matrix

Let $A$ be $(n,n)$ central Wishart matrix with $k$ degrees of freedom. my question is there is a way to estimate the expectation of: \begin{align} E[det(I+(I+A)^{-1})] \end{align}
hichem hb's user avatar
  • 377
2 votes
1 answer
185 views

Limiting distribution of "scatter matrix" $\frac{1}{n}XX^T:=\frac{1}{n}\sum_{i=1}^nx_ix_i^T$ for iid $x_1,\ldots,x_n \in \mathbb R^p$

Let $x_1,\ldots,x_n$ be drawn iid from such "nice" distribution on $\mathbb R^p$ (but possibly very general!), and let $X$ be the $n$-by-$p$ matrix formed by vertically stacking the $x_i$'s. ...
dohmatob's user avatar
  • 6,853
2 votes
1 answer
2k views

Bounds on the eigenvalues of the covariance matrix of a sub-Gaussian vector

Suppose that $\boldsymbol{x}\in\mathbb{R}^n$ is subgaussian random vector of variance proxy $\sigma^2$, i.e., $$\forall \boldsymbol{\alpha}\in\mathbb{R}^n: \quad \quad \mathbb{E}\left[ \exp\right(\...
Ali's user avatar
  • 127
2 votes
1 answer
560 views

Covariance matrix as optimization problem solution?

I have seen the expectation of a random vector expressed as the solution to the optimization problem: \begin{equation} \mathbb{E}[X]=argmin_{v \in \mathbb{R}^n}\mathbb{E}[\|X-v\|_{l^2}^2](:= \int_{\...
ABIM's user avatar
  • 5,405
2 votes
2 answers
228 views

Minimal conditions on random vector $X \in R^n$ to ensure that $\lim_{t\to 0^+}\sup_{\|w\|_p = 1}\sup_{u \in \mathbb R}\mathbb P(|X'w-u| \le t)=0$

Let $X$ be a random variable on $\mathbb R^n$ and let $S_p^n := \{w \in \mathbb R^n \mid \|w\|_p = 1\}$ be the unit-sphere w.r.t to the $\ell_p$-norm in $\mathbb R^n$. We will be particularly ...
dohmatob's user avatar
  • 6,853
2 votes
1 answer
90 views

Asymptotics of $w^\top G^2 w$, where $w$ is a unit-vector, $G:=X^T(XX^T+t I_n)^{-1}X$, $t > 0$, and $X$ is an $n\times d$ gaussian random matrix

Let $X$ be an random $n \times d$ matrix with entries drawn iid from $N(0,1/d)$ and let $w$ be a unit-vector in $\mathbb R^d$. With $\lambda>0$, and define $G:=X^\top(XX^\top + \lambda I_n)^{-1}X$. ...
dohmatob's user avatar
  • 6,853
2 votes
1 answer
187 views

Compute the limit of trace of inverse of square of rank-1 perturbation of Wishart matrix

Let $a \ge 0$, $b,c>0$ be fixed constants, and let $X$ be an $m \times d$ random matrix with entries drawn iid from $N(0,1/d)$. Consider the random psd matrix $S := a 1_m 1_m^\top + b XX^\top + c ...
dohmatob's user avatar
  • 6,853
2 votes
1 answer
378 views

Distribution of the Gram matrix

Let $\mathbf{X}$ be an $m\times k$ random matrix ($m>k$) of rank $k$, having the density function $f_\mathbf{X}(X)$. What is the distribution of $\mathbf{Y}=\mathbf{XX}^T$? Basically my question is ...
Peter's user avatar
  • 141
2 votes
1 answer
263 views

Probability distribution of uAv…

Consider the complex domain ℂ. If U and V are 2 unitary random matrices and A is a deterministic matrix. What is the distribution of $u^HAv$ ( or $||u^HAv||^2$) where : u is a column vector of U. v ...
tam's user avatar
  • 233