# Tagged Questions

**3**

votes

**1**answer

57 views

### Reference request: results on the asymptotic distribution of singular values related to a random orthogonal matrix

Let $Q$ be a random variable taking as its values the set of $n \times k$ real matrices with orthogonal columns, and whose distribution is the Haar measure on the Stiefel manifold $O(n)/O(n-k)$. This ...

**4**

votes

**1**answer

123 views

### Estimating the probability that $\|Av\| \ge \|v\|$

Given a diagonalizable matrix $A \in \mathbb{R}^{n \times n}$ with real eigenvalues, satisfying $1+c_1 \le \rho(A) \le 1+c_2$ $(0<c_1 \le c_2)$, obviously there exists a $v \in \mathbb{R}^{n}$ such ...

**11**

votes

**0**answers

475 views

### Probability a random Toeplitz matrix is singular

Consider Toeplitz matrices where the entries in the first row and column (which define the whole matrix) are independently chosen to be either $1$ or $0$ with probability $1/2$. Define $p_n$ to be the ...

**5**

votes

**1**answer

172 views

### “Ergodicity” for eigenvalues of random matrices?

Sorry if the wording of this question is sloppy, I have a weak background in probability theory (hence the quotation marks throughout).
Is there some "ergodicity-type" result for Wigner's semicircle ...

**15**

votes

**0**answers

265 views

### Quasi-classical limit of representation theory

I am looking for a good reference on a general phenomenon of quasi-classical limit in representation theory, which relates "large" representations to measures on (co-adjoint orbits of) the associated ...

**2**

votes

**1**answer

110 views

### What is the spectral norm of a random projection times a diagonal?

Take $n\ll N$. Let $P$ be an $n\times N$ matrix of iid $\mathcal{N}(0,1)$ random variables, and let $D$ be an $N\times N$ diagonal matrix.
What can be said about the distribution of the largest ...

**8**

votes

**1**answer

268 views

### Complexity of the union of randomly rotated unit cubes

It is a remarkable fact that the union of congrent cubes
has only at most near-quadratic combinatorial complexity,
$O^*(n^2)$ for $n$ cubes, known to be almost tight.
This contrasts with the union of ...

**1**

vote

**1**answer

82 views

### Expected rank - computable approximations

I'm interested in finding the expected rank of some random matrix $A$ (I don't want to specify its distribution right now, since my question makes sense in general).
Computing $\mathbb{E} \ ...

**4**

votes

**2**answers

828 views

### Eigenvalues of random Hamiltonian matrices

A real $2n\times 2n$ Hamiltonian matrix has the general form
$$H=\begin{pmatrix}
A & B \cr
C & -A^T
\end{pmatrix}
$$
where $A$, $B$ and $C$ are $n\times n$ matrices, and $B$ and $C$ are ...

**4**

votes

**0**answers

204 views

### How to generate a random (Weyl) curvature operator ?

Given a dimension $n$, the space of curvature operators is the space $S^2_B(\Lambda^2\mathbb{R}^n)$ of symmetric endomorphisms $R$ of $\Lambda^2\mathbb{R}^n$ which satisfy the first Bianchi identity :
...

**1**

vote

**0**answers

61 views

### Random Schrödinger operators with asymmetric Lifshitz tails?

For a quantum mechanical system with a periodic Hamiltonian (Schrödinger operator) $H$, let $N(E)$ be its integrated density of states, i.e. the fraction of eigenvalues in the spectrum $\sigma(H)$ ...

**2**

votes

**0**answers

105 views

### Quantifying the amount of structure in a data set via random matrix theory

Given a data matrix, $M \in \mathbb{R}^{n \times p}$, I am interested in methods quantifying the amount of structure in present in $M$.
I've found a few approaches, but I would like to learn more ...

**4**

votes

**2**answers

1k views

### Eigenvalue densities of sample covariance matrices when the population covariance matrix is a perturbed identity matrix

TLDR: I'm looking for a random matrix theory reference for the eigenvalue densities of sample covariance matrices (both dimensions approaching infinity at the same rate) when the true (population) ...

**8**

votes

**0**answers

342 views

### Has the technique of “sprinkling” been used in studying random matrices?

In 1982, while studying the component sizes of random subgraphs of a hypercube, Ajtai, Komlós, and Szemerédi introduced a technique that came to be known as sprinkling. In this technique, the edges of ...

**5**

votes

**1**answer

253 views

### Expected inverse determinant with independent rows

Let $a_1,a_2,\dots,a_n$ be independent identically distributed random vectors in $\mathbb R^n$. I need a bound for $E[|\det A|^{-1}]$, where $A$ is the matrix composed out of these vectors.
More ...

**9**

votes

**1**answer

652 views

### U(3) Sato-Tate measure.

An undergraduate is performing some computations, related to a Sato-Tate conjecture of $U(3)$ type (a curve over $Q$, for which the roots of local L-functions look like eigenvalues of a random matrix ...

**10**

votes

**3**answers

970 views

### Random Walks and Lyapunov exponents

Given a sequence $Y_1, Y_2, \dots$ of i.i.d. matrices in $GL_n(\mathbb R)$, there is a theorem of Furstenberg and Kesten which says that if $\mathbb E(\log||Y_1||)$ is finite, there exists a constant ...