Skip to main content

All Questions

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
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 ...
user1189053's user avatar
2 votes
0 answers
366 views

Convergence rate of Pearson correlation matrix

I am interested in (rather sharp if not the finest) tail/concentration bounds for the Pearson correlation matrix: let $X_1,\ldots,X_N \sim \mathcal{N}(0,1)$ be correlated random variables; let $\rho(...
mic's user avatar
  • 121
1 vote
1 answer
524 views

Optimal transport between two matrices

I'm investigating the use of optimal transport to define a distance between non-negative matrices that satisfy the condition $\mathbf e^\top\mathbf M\mathbf e = 1$ (i.e., the sum of all elements in ...
Peyman's user avatar
  • 243
1 vote
0 answers
57 views

Concentration inequality for matrix martingale with dynamic upper bounds

Consider a sequence of stochastic PSD matrices $X_1, X_2, \dots, X_n \in \mathbb{R}^{d\times d}$. Let $\mathcal{F}_k = \sigma(X_1, X_2, \dots, X_{k-1})$ be the natural filtration and $Y_k = \mathbb{E}[...
Y Zhou's user avatar
  • 11
1 vote
0 answers
112 views

Tools to bound the singular values of a finite sum of random matrices from below?

Matrix Chernoff bounds (see also this arXiv paper) are usually used to give upper bounds on the largest eigenvalue of a finite sum of random matrices. Sometimes it can also be used to give a lower ...
olivia's user avatar
  • 111