All Questions
5 questions with no upvoted or accepted answers
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 ...
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 ...
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 ...
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. ...
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}^...