All Questions
12 questions
0
votes
0
answers
57
views
Class of covariance matrices invariant under permutations
I am reading a paper on covariance matrix estimation, and in this paper is introduced a class of covariance matrices:
\begin{equation}
U(q, c_0(p),M)=\{\Sigma: \sigma_{ii}\leq M,\quad \max_j\sum_{j=1}^...
- 1
3
votes
0
answers
145
views
Eigenvalues of random matrices are measurable functions
I have read that if a random matrix is hermitian then its eigenvalues are continuous, hence also measurable.
If the random matrix is not hermitian, the eigenvalues are not continuous in some cases. ...
- 31
2
votes
1
answer
236
views
How can I prove a randomly generated matrix has distinct non-zero eigenvalues?
Consider the following $M×M$ matrix
$$
\mathbf A=\sum_{k=1}^K =a_k \mathbf h_k \mathbf h_k^H,(M≥K)
$$
where $a_k$'s are real values and $h_k$'s are $M×1$ randomly generated vectors, e.g., complex ...
- 31
2
votes
1
answer
263
views
Limit law of eigenvalue of random matrix with mean different to 0
If $X$ denotes a $m \times n$ random matrix whose entries are independent identically distributed random variables with mean $\mu$ and $\sigma^2 < \infty$, let
$$Y = X X^T$$
with $X^T$ the ...
- 335
9
votes
0
answers
802
views
Positive definiteness of matrix
This question is about the positive definiteness of a (non-random) matrix that is defined using random variables as follows:
We fix the vector $v=(1,1)$ (yet, it seems the final result does not ...
- 192
3
votes
1
answer
336
views
Eigenvalues of random graphs
At time $t=0$, let $G_n(V,E)$ be a graph with $n$ vertices and $m < n$ edges. Then there exists a unique symmetric adjacency matrix $A_n$ associated with $G_n(V,E)$, defined as follows: $a_{ij} = 1$...
- 101
4
votes
1
answer
372
views
Eigenvalues of random matrix conditional on positive definiteness
Consider the Gaussian Orthogonal Ensemble, considered as a probability measure $\mu$ on the space of real symmetric matrices. Let $\mu|PD$ denote this measure conditioned on the event that the matrix ...
- 505
3
votes
2
answers
2k
views
Expected value of the largest singular value of a random matrix with entries in $N (0,1)$
Given a matrix $A \in \mathbb R^{n \times n}$ whose entries are i.i.d. $N(0,1)$, what is the expected value of its largest singular value? Equivalently, what is the expected value of the largest ...
- 33
3
votes
1
answer
371
views
Eigenvectors of a perturbed reducible stochastic matrix
Let $Q$ be a $n\times n$ reducible stochastic matrix. Let $J$ be such that $[J]_{ij}={1 \over n}$. Now for a small positive constant $\alpha\in [0,1]$, consider the matrix
$$\tilde{Q}\,=\,(1-\alpha)...
- 1,421
5
votes
0
answers
327
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 ...
- 161
12
votes
0
answers
825
views
Eigenvalues of permutations of a real matrix: how complex can they be?
This is sort of complementary to this thread. I’ll repeat the definitions here:
For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and ...
- 13.4k
22
votes
4
answers
5k
views
Eigenvalues of permutations of a real matrix: can they all be real?
For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and define the total spectrum $TS(M)$ as the union of all their spectra (counting ...
- 13.4k