Statistics of spectral properties of matrix-valued random variables.

learn more… | top users | synonyms

26
votes
0answers
1k views

Correspondence between eigenvalue distributions of random unitary and random orthogonal matrices

In the course of a physics problem (arXiv:1206.6687), I stumbled on a curious correspondence between the eigenvalue distributions of the matrix product $U\bar{U}$, with $U$ a random unitary matrix and ...
25
votes
0answers
2k views

When should we expect Tracy-Widom?

The Tracy-Widom law describes, among other things, the fluctuations of maximal eigenvalues of many random large matrix models. Because of its universal character, it obtained his position on the ...
18
votes
0answers
1k views

The Fourier Transform of taking Eigenvalues

The purpose of this question is to ask about the Fourier transform of the map which associate to an $n$ by $n$ matrix its $n$ eigenvalues, or some function of the $n$ eigenvalues. The main motivation ...
16
votes
0answers
553 views

Random Distance Matrices

My question is motivated by the following recent paper: http://arxiv.org/abs/1110.6333 Assume you have a metric space $(X,d)$ equipped with a Borel probability measure $\mu$. We can further assume ...
15
votes
0answers
340 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 ...
13
votes
0answers
333 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 ...
12
votes
0answers
426 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 ...
11
votes
0answers
214 views

What are the difficulties in proving almost-everywhere stability of Gaussian elimination?

It is well known that Gaussian elimination without pivoting is numerically unstable, and in practice Gaussian elimination is done with row pivoting (partial pivoting). A theorem of Wilkinson states ...
11
votes
0answers
330 views

Lower Bound on the Volume of Certain Polytopes

Given a partition $\rho\in\mathcal{P}(n)$ with $k$ blocks $$ \rho=\{B_1,B_2,\ldots,B_{k}\} $$ we can define the set of equations $$ E_{i}:\sum_{j \in B_{i}}{x_{j-1}}=\sum_{j \in ...
9
votes
0answers
379 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 ...
8
votes
0answers
430 views

Framework for primes vs random matrices

This is inspired by What results would follow from or imply "randomness" of the primes? , but I think it is sufficiently different to ask separately. We can formalise probability in ...
8
votes
0answers
295 views

A formula for moments of the limit distribution of singular values in the proof of the circular law

One of the steps in the proof of the circular law in random matrix theory is obtaining the limiting spectral distribution for the matrix $(\frac{1}{\sqrt{n}} X_n - zI)(\frac{1}{\sqrt{n}} X_n - ...
7
votes
0answers
205 views

What is the reason the eigenvalues of GUE and CUE matrices tend locally to the same distribution?

It's well known in random matrix theory that locally the eigenvalues of a random matrix from the Gaussian unitary ensemble tend to a sine-kernel determinantal point process. Likewise, locally the ...
6
votes
0answers
94 views

irregular LDPC code construction algorithm

I want to construct a sparse random binary matrix ${{\bf{H}}_{m \times n}}$ that has the following properties 1- Faction of columns of weight $i$ is ${v_i}$ . 2- Fraction of rows of weight ...
6
votes
0answers
173 views

Behavior of eigenspaces of adjacency matrices of random graphs (not via perturbation theory)

For the sake of discussion, let us say that we have the adjacency matrix $A$ of a graph, on $n$ nodes, from a stochastic block model with 2 blocks. Another name for this (usually used in computer ...
5
votes
0answers
102 views

Eigenvalues of Random Regular Bipartite Graphs

I am looking for a way of getting a good estimate of the eigenvalues of random bipartite d-regular graphs. The literature has very precise values the proofs of which are very involved and since I am ...
5
votes
0answers
231 views

Kasteleyn, Gessel-Viennot and eigenvalues

The Kasteleyn matrix (for counting perfect matchings) and the Lindström-Gessel-Viennot matrix (for counting families of nonintersecting lattice paths) are tightly related, as observed many times by ...
5
votes
0answers
188 views

Quasicompactness of transfer operators associated to IID matrix products

Let $P^1$ denote one-dimensional real projective space, and for each $A \in GL(2,\mathbb{R})$ let $\overline{A}$ denote the homeomorphism of $P^1$ induced by $A$. I am currently reading a paper which ...
4
votes
0answers
97 views

Christoffel-Darboux type identity

The classical Christoffel-Darboux identity for Hermite polynomials reads $$\sum_{k=0}^n\frac{H_k(x)H_k(y)}{2^k k!}=\frac{1}{2^{n+1} n!}\frac{H_{n+1}(x)H_n(y)-H_n(x)H_{n+1}(y)}{x-y}.$$ I am ...
4
votes
0answers
51 views

Spectrum of sum of fixed matrices with random signs

Let $A_1,\ldots,A_k$ be a given sequence of $N$-by-$N$ Hermitian matrices. Assume all have spectrum contained in $[-1,-\delta] \cup [+\delta,+1]$ for some $\delta>0$. Let $$A=\frac{1}{\sqrt{k}} ...
4
votes
0answers
111 views

Expectation of a specific random variable on the probability space of $n\times n$ matrices over $\{0,1\}$

Let $\mathcal{G}_{n,\frac{1}{2}}$ be the probability space of $n\times n$ matrices over $\{0,1\}$ and each entry of the matrix is independently equal to 1 with probability $\frac{1}{2}$ and equal to 0 ...
4
votes
0answers
133 views

The distribution of the elements of an eigenvector of random matrices

Suppose a random matrix $A$ with its elements following Gaussian distribution with non-zero mean. We know that the eigenvalues of $A$ have two patches: one is at the real axis that is far away from ...
4
votes
0answers
78 views

Can the GUE be thought of as a uniform point in a high-dimensional polytope

I have thought about this question for a long time and could only find partial answers. The Gaussian Unitary Ensemble (or GUE) is the eigenvalues of a random Hermitian matrix with complex Gaussian ...
4
votes
0answers
332 views

An integral with respect to the Haar measure on a unitary group

Let $A,D\in \mathbb{C}^{n \times n}$ be diagonal matrices. I need to calculate $$\int_{U(n)}\det{(A-HDH^\dagger)}\,\mathrm{d}H$$ where $dH$ is the unit invariant Haar measure on the group of unitary ...
4
votes
0answers
54 views

Homogeneity degree one functions of a matrix argument

I am interested in homogeneity degree one (scalar-valued) functions of a matrix argument. The simplest setup is as follows. Let $X$ be a symmetric $3\times 3$ matrix with real entries. Let $f$ be a ...
4
votes
0answers
270 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 : ...
4
votes
0answers
1k views

Distribution of Inverse of a Random Matrix

Recently i got stuck into a problem and couldn't find its satisfactory answer anywhere. My question is simple. Suppose i have a fat random matrix (i,e $R$ has dimensions $k\times d$ where $k<d$) ...
4
votes
0answers
432 views

Relationship between R-transform and free convolution of random matrices?

I've been using the R-transform to calculate the free convolution of the eigenvalue spectra of two random matrices and I am trying to understand how it works, and in particular how it relates to ...
4
votes
0answers
259 views

Stable distributions for Lindeberg exchange strategy?

Terence Tao has mentioned the importance of the Lindeberg exchange strategy, citing as an application how it was used in the proofs of some recent results relating to universality laws for random ...
4
votes
0answers
212 views

q-deformation of the unitary group integral

There is a well-known orthogonality property of $U(N)$ group characters $$ \int d U \chi_{\mu}(U)\chi_\lambda(U^\dagger V)=\delta_{\mu\lambda}\frac{\chi_\mu(V)}{\dim_\mu} $$ where the integral is ...
3
votes
0answers
36 views

Bound on principal angle of uniform random subspaces of different dimensions?

This paper derives the distribution of the largest principal angle between two subspaces sampled (independently) uniformly from the Grassmanian manifold of $p$-dimensional subspaces in $\mathbb{R}^d$, ...
3
votes
0answers
110 views

Upper bound on largest singular value of a heavy tailed random matrix

Let $A$ be a $k\times n, k<n-1$ random matrix with entries drawn i.i.d. from a standard Gaussian, and $B$ a $k\times m$ random matrix with entries drawn i.i.d from a standard Gaussian, and ...
3
votes
0answers
62 views

Matroid rank decay

Consider a uniform vector matroid $M(0)=U_{m,n}$ of rank $m$ with $n$ points, $n>m>2$ (you can think of it as a set of $n$ points in general position in vector space $F^m$ for some large field ...
3
votes
0answers
90 views

Exact growth rate of Longest Increasing Subsequence expectation

Let $S_n$ be the symmetric group, $\pi\in S_n$ a uniformly random permutation and $L_n:=L_n(\pi)$ denoting the length of the longest increasing subsequence (LIS). We know that ...
3
votes
0answers
198 views

Eigenvalue Gap Probability Through Method of Moments

Let $M_n$ be drawn from $n\times n$ matrices under the Circular Orthogonal Ensemble (COE) distribution. Then the eigenvalues of $M_n$ all lie on the unit circle. Starting on the real line and going ...
3
votes
0answers
200 views

Matrix where every subset of rows has maximal rank

I am looking for a class of matrices $M(n(m), m, k(m), \phi)$ with the following properties: M is $n \times m$ where $n(m) > m$. Every subset of rows of size $k$ has (maximal) rank $m$. $n(m)$ ...
3
votes
0answers
223 views

Concentration of functions of random unitary matrices

Suppose $U$ and $V$ are $n \times n$ random unitary matrices, chosen independently from the Haar measure. Is there any kind of concentration inequality which would be applicable to polynomials ...
2
votes
0answers
43 views

Literature on transformed Gaussian matrices

I am considering real $n$-by-$m$ matrices of the following type: $$ M=SM^\prime,\\ M^\prime_{ij}\sim^{iid}N(0,1). $$ Here, $S$ is a fixed $n$-by-$n$ matrix and the entries of $M^\prime$ (same size ...
2
votes
0answers
110 views

Eigenvalue perturbation of a symmetric matrix by a random orthogonal projection

Given fixed real symmetric $D\in\mathbb{R}^{n\times n}$ with $n$ distinct eigenvalues, let $U$ be a random orthogonal matrix selected uniformly from the space of $n\times n$ orthogonal matrices, and ...
2
votes
0answers
332 views

Largest eigenvalues distribution of tridiagonal symmetric random matrix

I would like to find the largest eigenvalue distribution of the following tridiagonal symmetric random matrix in an analytic way. All the ${\lambda}_i$ are distributed the same way with chi-square ...
2
votes
0answers
55 views

Modularity in a graph - definition of the random component

This question concerns the definition of modularity in a graph. Consider a simple, undirected, unweighted graph $G$ with vertices in set $V$ and edges in set $E$ . Between any two vertices there is ...
2
votes
0answers
80 views

Smallest Singular Value of a Random Matrix with Dependent Entries

Overview I am trying to bound from below the smallest singular value $\sigma_{n}$ of a sequence of symmetric $n$ by $n$ random matrices $M_{n}$ with dependant entries. In particular, I would like to ...
2
votes
0answers
100 views

“Semiclassical approximation” in random matrix theory

I am reading Planar Diagrams by Brezin, Parisi, Itzykson and Zuber. If you specialize the discussion in section 5 there we seem to derive the eigenvalue distribution of $N \times N$ random Hermitian ...
2
votes
0answers
164 views

Random matrices whose limit gives exact Wigner surmise

Let $M$ come from an ensemble of $N\times N$ matrices. The Wigner surmise is density function $p^W_0(s)=\frac{\pi}{2}se^{-\pi s^2/4}$. From a random matrix point of view, we can write ...
2
votes
0answers
83 views

Stricter Notion of Crossing in a Partition

Let $k$ be an integer. Traditionally a partition $\pi=V_1\cup \dots \cup V_n$ of the set $[k]:=\{1,\dots, k\}$ is called crossing when there exist $a,c\in V_i$ and $b,d\in V_j\not= V_i$ such that ...
2
votes
0answers
125 views

Finite Volume 1D Anderson Tight Binding Model

My question is about bounds on the number of eigenvalues in a microscopic interval for the random Schrodinger operator on $\mathbb{Z}_n$ for $n \in \mathbb{N}$. For my question, these are the ...
2
votes
0answers
142 views

Random square submatrices of a Hadamard matrix

Question: For $N$ be a power of $2$, let $A$ be a random $d \times d$ submatrix of the $N \times N$ Hadamard matrix (the matrix of the Hadamard/Walsh-Fourier transform). What is the best known upper ...
2
votes
0answers
271 views

Distributions of eigenvalues for matrix normal distribution: related references

I am interested in the distribution of the eigenvalues of matrices that are sampled from the matrix normal distribution. I am sampling from $p(X \mid M,U,V)$ and let's assume that I know the ...
2
votes
0answers
71 views

Packing symmetric matrices in spectral norm, and defining measures on symmetric matrices

I'm trying to upper bound the $\epsilon$-packing number of $\Theta=\{A\in\mathbb{S}^{d}:\; a\preceq A \preceq b\}$ (where $\mathbb{S}$ are symmetric $d\times d$ matrices) for some $a\leq b$ with ...
2
votes
0answers
190 views

Error bound on matrix vector multiplication

I am multiplying a matrix $A$ with vector $p$. However, the matrix $A$ isn't accurate. Some (a very small fraction) of the element's value is changed from $a_{i,j}$ to {0,$-a_{i,j}$, $2a_{i,j}$}. ...