Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
29 views

What is known about the distribution of eigenvectors for random positive semidefinite matrices?

Let $\{x_i\}_{i=1}^n \subset \mathbb{R}^d$ be iid random vectors drawn from probability measure $P$. Define the random $d \times d$ real positive semidefinite matrix, $$ S_n = \frac{1}{n} \sum_{i=1}^n ...
Drew Brady's user avatar
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
1 vote
0 answers
66 views

CLT of the left singular vectors of i.i.d. data matrix

Let $\mathbf{X}$ be $(n \times p)$-dimensional random matrix ($n > p$) whose rows $\mathbf{x}_i$ are i.i.d. with some finite moments: $$ \mathbf{X}^\top = [\mathbf{x}_1, \ldots \mathbf{x}_n]^\...
Seung Hyeon Yu's user avatar
1 vote
1 answer
84 views

Asymptotic property of the left singular vectors of i.i.d. data matrix

Let $\mathbf{X}$ be $(n \times p)$-dimensional data matrix ($n > p$) whose rows $\mathbf{x}_i$ are i.i.d. with some finite moments: $$ \mathbf{X}^\top = [\mathbf{x}_1, \ldots \mathbf{x}_n]^\top. ...
Seung Hyeon Yu's user avatar
2 votes
1 answer
704 views

Distribution of eigenvectors of random matrices and link with the components of the matrix

Let $M$ be a real symmetric matrix of size $N$ with its components $M_{ij}$ following a normal distribution centered around 0. Let $x\in\mathbb{R}^N$ be an eigenvector of $M$ with eigenvalue $\lambda\...
Matt's user avatar
  • 117
13 votes
1 answer
697 views

$\ell^1$-norm of eigenvectors of Erdős-Renyi Graphs

Setting. Let $G(n,p)$ denote the usual Erdős-Renyi (random) graphs. For each such graph there is an associated Laplacian matrix $L = D - A$ where $D$ collects the degrees on the diagonal and $A$ is ...
Stefan Steinerberger's user avatar
0 votes
1 answer
123 views

Probability eigenvectors of discrete random matrix are orthogonal to discrete random vector

Let $W=(w_{ij})_{1 \leq i, j \leq N}$ and $\textbf{v}=(v_j)_{1 \leq j \leq N}$ be a random $N\times N$ matrix and N-vector, respectively, where all $w_{ij}$ are jointly independent and have discrete ...
dwood04's user avatar
1 vote
1 answer
96 views

Can eigenvectors determine their original matrices given the basis of matrices space is small?

Let $A_1$, $A_2$, and $A_3$ be three different mutually orthogonal random hermitian operators, say dimension of $30\times 30$. For three random real numbers $a_1$, $a_2$, $a_3$, we have $$ (a_1A_1+...
Sirui Lu's user avatar
5 votes
1 answer
473 views

Statistical independence of eigenvectors of real symmetric Gaussian random matrices

What is known about the statistical independence of the eigenvectors of a real symmetric matrix with independent Gaussian entries with zero mean, and finite variance? The matrix elements are not ...
user125930's user avatar
3 votes
1 answer
656 views

Upper bounds on the condition number of the eigenvector matrix

Let $A$ be an $n\times n$ real matrix with entries in a fixed interval $[a_\min,a_\max]$, with $a_\min$, $a_\max>0$. Question: Are there any upper bounds on the condition number of the ...
Ludwig's user avatar
  • 2,712
0 votes
1 answer
353 views

Almost sure convergence of smallest eigenvector of diagonal matrix

I have that a sequence of random matrices, $M_n$, converges almost surely to a diagonal matrix, $D$, with finite real entries on its diagonal. During convergence, the off-diagonals are not necessarily ...
PThomasCS's user avatar
  • 399
4 votes
0 answers
463 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 ...
Zedong Bi's user avatar
3 votes
2 answers
4k views

Singular Value Decomposition of Noisy Matrices

I am an engineer who makes measurements of a variable over a grid of, say, $m\times n$. Since these are actual measurements, the true values are always corrupted by noise, and what I measure is a ...
Sankara Subramanian's user avatar
0 votes
0 answers
419 views

PrincipAl Eigenvector of a Random Matrix

Let $A$ be a random matrix, let $\mathbf{x}$ be the singular vector associated with $\|A\|$. Let $\bar A$ be the entry wise expectation of $A$, and let $\mathbf{\bar x}$ be the singular vector ...
fkenter's user avatar
  • 316