Skip to main content

Questions tagged [random-matrices]

Statistics of spectral properties of matrix-valued random variables.

Filter by
Sorted by
Tagged with
1 vote
2 answers
305 views

Joint moments like $\tau(XYXYXY)$ in terms of individual moments of free variables $X,Y$

Terry Tao RMT book has the following formula for joint moment of freely independent random variables $X,Y$ in Section 2.5 $$\tau(XYXY)=\tau(X)^2\tau(Y^2)+\tau(X^2)\tau(Y)^2-\tau(X)^2\tau(Y)^2$$ ...
Yaroslav Bulatov's user avatar
6 votes
1 answer
174 views

A second-order recursion (functional equation)

In a calculation of some momenta of random matrices (GOE), I encounter a functional equation, in the form of a second-order recursion, $$L(s+1)=L(s)+2s(2s+1)L(s-1).$$ Is it familiar to someone ? Is ...
Denis Serre's user avatar
  • 52.3k
0 votes
0 answers
82 views

Conditional distributions of random orthogonal projection matrix

I have encountered a rather curious question. Suppose I have a symmetric idempotent orthogonal projection matrix $A\in\mathbb R^{N\times N}$ that projects onto a uniformly random $n$-dimensional ...
Landon Carter's user avatar
3 votes
2 answers
215 views

Is there a closed-form solution for $\max_D \operatorname{Tr}(ADBD)$

Is there a closed-form solution for $$\max_D \operatorname{Tr}(ADBD)$$ where $D$ is a $N\times N$ diagonal matrix with $m<N$ number of $1$'s and the rest are $0$'s, and $A$ and $B$ are real ...
CWC's user avatar
  • 433
1 vote
0 answers
77 views

Moment method / genus expansion for random matrices with i.i.d. entries

Given a (say real) random matrix $M=(M_{i,j})_{1\leq i, j \leq N}$, the moments method consists in computing (the limits in $N$ of) the quantities $$ \mathbb{E} \left(\mathrm{tr} M^k\right)^{1/k}, $$ ...
Panda Jonas's user avatar
1 vote
0 answers
72 views

Dimension-free sample complexity for the inverse of Gaussian sample covariance?

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need the inverse of the sample covariance $\Sigma_m^{-1}$ to be $\varepsilon$-close to true inverse covariance $\Sigma^{-1}$ (in ...
axk's user avatar
  • 517
10 votes
2 answers
615 views

What are applications of asymptotic freeness of random matrices?

In around 1990 Voiculescu showed asymptotic freeness of certain random matrices, i.e., free independence when the matrix size goes to infinity. Since then this link between free probability and random ...
Bart's user avatar
  • 201
1 vote
0 answers
48 views

Random matrices: Relation between leading eigenvector and a vector in culumn space

Let $X$ be a $n\times n$ symmetric matrix with iid zero-mean random entries on and above the diagonal. Denote by $v$ the eigenvector corresponding to the largest eigenvalue of $X$. Let $a$ be a fixed $...
legon's user avatar
  • 31
5 votes
0 answers
244 views

$\log\det$ asymptotics of a skew-circulant matrix with additive diagonal bimodal disorder

I'd like to share a problem that I have been dealing with for a longer time now. In the framework of quenched disorder in the square-lattice Ising model I want to calculate, for large even $M$, the ...
Fred Hucht's user avatar
  • 3,691
4 votes
1 answer
447 views

Reference book on Riemann zeta function and random matrices

What is a reference book to understand the relation between the Riemann zeta function and random matrices?
Cosimo's user avatar
  • 43
2 votes
1 answer
237 views

Expected norm of a product of Gaussian matrices

Suppose $C_n$ is a product of $n$ $d\times d$ matrices with IID entries coming from standard normal. The following appears to be true. Is there an elementary proof? $$E[\|C_n\|_F^2]=d^{n+1}$$ This ...
Yaroslav Bulatov's user avatar
1 vote
0 answers
59 views

Distribution of joint Gaussian conditional on their sum of squares

Given a random gaussian matrix $\mathbf{X}$ with zero mean matrix and covariance matrix $\mathbf{\Sigma}$, and two deterministic matrices $\mathbf{A}$ and $\mathbf{B}$. If I know the value of $\|\...
Sheperd Lv's user avatar
7 votes
2 answers
347 views

Matrices over $\mathbb{F}_p$ that have nonzero determinant under any element permutation

$\DeclareMathOperator\GL{GL}$A few months ago, the following discussion took place on AoPS, concerning matrices that have nonzero determinant under any permutation of their entries: https://...
TheBestMagician's user avatar
2 votes
1 answer
129 views

Isolated eigenvalues of a random matrix

This is a continuation of this question. Let $O$ be a random orthogonal matrix (according to Haar measure) of size $n$. I want to study the eigenvalues of the matrix $O+O^\top + \lambda uu^\top$ where ...
Pluviophile's user avatar
  • 1,608
4 votes
1 answer
237 views

Spectral density of symmetrized Haar matrix

Let $O$ be a random orthogonal matrix (according to Haar measure) of size $n$. I found by simulations that the spectral density of $O+O^\top$ is the arcsin law rescaled to the interval $[-2,2]$. I can'...
Pluviophile's user avatar
  • 1,608
1 vote
0 answers
57 views

Limiting value of expectation of trace of truncated Gram matrix

Let $n$ and $d$ be large positive integers such that $d/n = a \in (0,1)$, fixed. Let $x_1,\ldots,x_n$ be iid random vectors from $N(0,I_d)$. Fix $b \in (0,1]$ and a unit-vector $v \in \mathbb R^d$, ...
dohmatob's user avatar
  • 6,853
1 vote
0 answers
54 views

Controlling quantity related to Laplacian pseudo-inverse of Erdős–Rényi graph

Consider an $n$-node undirected graph $G = (V, E)$ equipped with weights $W$. Let $L$ be the weighted graph Laplacian matrix, i.e. $L_{ij} = -W_{(i,j)}$ for $(i,j)\in E$ and $L_{ii} = \sum_{j:(i,j)\in ...
yy98's user avatar
  • 11
8 votes
1 answer
319 views

Why does this combinatorial sum vanish?

We define the coefficients $c_{k,k-i}$ of ${n \choose k}$ by the following easy expansion: \begin{align*} & {n \choose k} = \frac{1}{k!} n(n-1) \dots (n-k+1) = \frac{1}{k!} \prod\limits_{t=...
Ben Deitmar's user avatar
  • 1,295
2 votes
0 answers
146 views

What are the name and inverse of an interesting integer matrix?

It is practicable to compute the matrix inverses \begin{align*} \begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 1 \\ 1 & 2 & 2^2 \\ \end{pmatrix}^{-1} &=\begin{pmatrix} 1 & 0 &...
qifeng618's user avatar
  • 1,091
9 votes
2 answers
496 views

Is there a determinantal point process proof of the Keating-Snaith formula for the cumulants of the log characteristic polynomial of a random matrix?

For $U$ a unitary $N \times N$ matrix, randomly distributed according to Haar measure, we have the complex-valued random variable $\log (\det (1-U))$. The real part and imaginary parts of $\log (\det (...
Will Sawin's user avatar
  • 148k
1 vote
0 answers
67 views

Random matrix theory: accounting for mean

Assume a random matrix, denoted as $X$, which is an $n$ by $T$ matrix, $T\geq n$. While I understand the typical scenario where the random variables $X_{ij}$ are sampled from a $\mathcal{N}(0,\sigma_{...
Pooja Algikar's user avatar
1 vote
0 answers
94 views

Is there a way to linearize matrix quadratic forms?

Say $x$ is a random vector in $\mathbb{R}^n$. Then, given a (deterministic) symmetric real positive definite matrix $A$, if we want to calculate the expectation of the quadratic form, we can use the ...
Drew Brady's user avatar
1 vote
0 answers
145 views

Complexity of calculating the expectation of $\operatorname{Tr} h(A)$, $A$ is a random matrix

$A$ is a $d_1\times d_1$ random matrix. Given $\{g_i\}~(1\leq i\leq n)$ iid Gaussian variables, $f_{ij}(g_1,g_2,...,g_n)~(1\leq i,j\leq d_1)$ are degree-$d_2$ polynomials. And $f_{ij}\equiv f_{ji}~(\...
qmww987's user avatar
  • 91
8 votes
3 answers
508 views

Free probability: A unitary group heuristic for the relationship between additive free convolution and free compression

From one perspective, free probability is the study of how the eigenvalues of large random matrices interact under the basic matrix operations. The free probability operations of free additive ...
Samuel Johnston's user avatar
3 votes
1 answer
269 views

Trace of product of two Wishart matrices

Let $A,B$ be two independent complex Wishart matrices, $A,B\sim CW_p(\mathbf{I},n)$, that is $A=\frac1n GG^\dagger$& $B=\frac1n QQ^\dagger$ where $G$ and $Q$ are independent $p\times n$ complex ...
Shadumu's user avatar
  • 85
8 votes
0 answers
170 views

Random walk on matrix until singularity

Consider a random walk on matrices, where one starts with the matrix $M=I_n$ and at each step randomly chooses an entry of $M$ to increase by $1$. I’m interested in two things about this walk: What’s ...
TheBestMagician's user avatar
4 votes
1 answer
276 views

Why are singular values of random matrix $[X \mid Y] \in \mathbb{R}^{N\times 2T}$ so close to those of $XY^T \in \mathbb{R}^{N \times N}$, $X\sim Y$

As an accidental byproduct of some numerical simulations I have been doing as part of a research paper in machine learning, I made the observation that the singular values of the random matrix $\frac{...
Paul's user avatar
  • 171
2 votes
0 answers
120 views

Random matrices may be asymptotically free but never free themselves?

It is well known that independent $N\times N$ unitarily-invariant random matrices (or independent families of random matrices) may be asymptotically free as $N\to \infty$ with respect to the ...
user510187's user avatar
5 votes
1 answer
400 views

Lower tail of random rank one sums?

Let $\{x_i\}_{i\geq 1}$ be iid random elements of the sequence space $\ell^2(\mathbb{N})$; assume that $\|x_i\|_2 \leq 1$ almost surely. Let $\Sigma = \mathbb{E}[x_1 \otimes x_1]$. Define $$ \Sigma_n =...
Drew Brady's user avatar
3 votes
0 answers
117 views

Is the exact formula for the trace moments of an isotropic complex Wishart matrix known?

Let $\mathbb{X}_{p,n}$ be a $(p \times n)$ random matrix whose entries are iid complex standard normal random variables. The hermitian random matrix $\mathbb{S}_{p,n} = \frac{1}{n} \mathbb{X}_{p,n} \...
Ben Deitmar's user avatar
  • 1,295
0 votes
0 answers
84 views

Expectation of the trace of random matrix with an inverse insided

Consider a $N$-dimensional random complex vector $\mathbf{x} \in \mathbb C^{N \times 1}$ following the complex Gaussian distribution, i.e., $\mathbf{x} \sim {CN}(0,\sigma^2 \mathbf{I})$, where $\...
Prokins Wang's user avatar
19 votes
0 answers
3k views

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
2 votes
0 answers
269 views

Singular values of Kronecker product of random matrices

I'm looking for a way to evaluate $\mathbb{E} \| (\mathbf{X} \mathbf{Q})^+ \|$ for a random matrix $\mathbf{X} \in \mathbb{R}^{r \times n}$ and a (fixed) matrix $\mathbf{Q} \in \mathbb{R}^{n \times \...
Uria Mor's user avatar
  • 121
1 vote
1 answer
69 views

Expected value of MGIG distribution

I'm currently dealing with a Gibbs sampler of the multivariate generalized inverse Gaussian distribution (MGIG). In order to check the correctness of the sampler, I'd like to know the expected value ...
Stéphane Laurent's user avatar
0 votes
0 answers
27 views

Probability that two random gaussian matrix will have large distance

I have two independent random gaussian matrix $A$ and $B \in R^{d\times n}$, and i want to compute an upper bound of the probability that $$Pr(\left\| (A-B)(A+B)^T\right\| \leq a)$$ One method might ...
Shouitch Chuu's user avatar
1 vote
1 answer
97 views

Expected value of the projective metric between random orthogonal Stiefel matrices in $\mathbb{R}^{N \times k}$ equals $1 - \frac{k}{N}$

This is a cross-post from this other question that I asked ~1 month ago in the mathematics forum, with no reaction. I am still stuck on this, looking for references or approaches to proofs. I hope I ...
fr_andres's user avatar
  • 113
1 vote
1 answer
207 views

Anti-concentration inequality for the eigenvalue of Gaussian matrix

Let $f(x) = f(x_1, . . . , x_n)$ be a polynomial of degree $d$ and $\text{Var}[f] = 1$. One result by Carbery and Wright shows that for any $t\in\mathbb{R}$ and $ε > 0$, $$ \text{Pr}_{x\sim N^n}[|f(...
qmww987's user avatar
  • 91
0 votes
0 answers
112 views

Additivity of purity of random matrix products

Suppose $M$ is an $n\times n$ matrix with IID random entries drawn from $\mathcal{D}$ and $\sigma$ is the vector of its singular values. Define purity of $M$ as $$\rho(M)=\frac{n \sum_i \sigma_i^4}{\...
Yaroslav Bulatov's user avatar
6 votes
1 answer
271 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
0 votes
0 answers
115 views

Expectation of the operator norm of projection of a random permutation matrix

Assuming I have a fixed dimension $p$ subspace of $\mathbb{R}^d$ orthogonal to $1^d$ and $VV^\top$ with $V \in \mathbb{R}^{d \times p}$ is the orthogonal projection to the subspace. What bound can I ...
Kaiyue Wen's user avatar
2 votes
2 answers
215 views

How to analyze the value of convergence of functions of random matrices?

Consider a random i.i.d matrix $\mathbf{A}_{m\times n}$ with entries generated from a complex Gaussian distribution with zero mean and unit variance. I am interested in the large dimension analysis of ...
Math_Y's user avatar
  • 287
0 votes
0 answers
69 views

Spectrum of Moore-Penrose pseudo-inverse multiplied by a constant

Consider a random rectangular matrix $X\in\mathbb{R}^{N\times P}$ where each entry is drawn from iid distribution with mean $m$ and variance $s^2$, and denote $X^+$ the Moore-Penrose pseudo-inverse. ...
Uri Cohen's user avatar
  • 373
4 votes
1 answer
517 views

Taylor expansion of Stieltjes Transform

I'm trying to derive a very basic result stated in several books on random matrix theory (e.g. Terry Tao's book and Potters & Bouchaud's book). Given a symmetric matrix $A \in \mathbb{R}^{N \times ...
digbyterrell's user avatar
3 votes
1 answer
307 views

Request for references of random matrices

I need some good books aimed as a detailed and gentle introduction to random matrices, containing good discussion and derivation of Marchenko–Pastur distribution. Also, I request some other references ...
AgnostMystic's user avatar
2 votes
0 answers
96 views

Limiting value of $\dfrac{1}{m}\mathrm{tr}(FAF^\top (FBF^\top)^{-1})$, where $F$ has iide $N(0,1)$ entries and $A,B$ are deterministic

Let $F=F_{m,d}$ be a random $m \times d$ matrix with iid entries from $N(0,1)$. Let $A=A_d$ and $B=B_d$ be deterministic $d \times d$ positive-definite matrices. In case it helps, it may be assumed ...
dohmatob's user avatar
  • 6,853
1 vote
0 answers
68 views

Limiting value of expectation of $\operatorname{tr}(BR(z))$, where $R(z) := (X^\top X - z I_d)^{-1}$ and $X \sim N_{n,d}(0,A)$

Let $A=A(d)$, and $B=B(d)$ be (sequences of) deterministic positive-definite $d \times d$ matrices and let $X$ be an $n \times d$ random matrix with iid rows from $N(0,A)$. Let $R$ be the resolvent of ...
dohmatob's user avatar
  • 6,853
0 votes
1 answer
77 views

Estimation on rotationally-disturbed random vectors

During developing a new statistical estimator, I faced the following problem. Let $\mathbf{x}_i$ be a sequence of i.i.d. $d$-dimensional random vectors with \begin{align*} \mathbf{x}_i = \mathbf{O}...
Seung Hyeon Yu's user avatar
2 votes
1 answer
328 views

Matrix Bernstein's inequality: from tail probability to expectation

Let $X_i$ be independent, mean zero, $n\times n$, symmetric random matrices. $\|X_i\|\leq K$ almost sure for $\forall I$. We have matrix Bernstein's inequality for the tail probability as follows $$\...
happyle's user avatar
  • 49
2 votes
0 answers
52 views

Trouble understanding a Lemma in Pastur's Paper

I'm having trouble understand Eq 3.51 Lemma 3.3 in https://arxiv.org/pdf/2001.06188.pdf The basic premise is $$\begin{align} &\eta _{j}(t)=t^{1/2}\eta _{j}+(1-t)^{1/2}q_{n}^{1/2}\gamma _{j}, \;t \...
Anvit's user avatar
  • 121
3 votes
1 answer
243 views

Existence of a matrix with bounded entries and large smallest singular value

Is the following statement true? For all $n$ large enough, there exists an $M_n \in [-1,1]^{n \times n}$ such that the smallest singular value of $M_n$, $\sigma_n(M_n) \gtrsim \sqrt{n}$. If $n$ is ...
Mathews Boban's user avatar

1
2
3 4 5
18