Skip to main content

All Questions

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

Expectation of the operator norm of projection of a random permutation matrix

Assuming I have a fixed dimension $p$ subspace of $\mathbb{R}^d$ orthogonal to $1^d$ and $VV^\top$ with $V \in \mathbb{R}^{d \times p}$ is the orthogonal projection to the subspace. What bound can I ...
Kaiyue Wen's user avatar
1 vote
0 answers
66 views

About symmetric rank-1 random matrices

Consider a $2n-$dimensional symmetric random matrix $M$ of form, $M = \begin{bmatrix} aa^T & ab^T \\ ba^T & bb^T \end{bmatrix}$ where $a$ and $b$ are $n$ dimensional random vectors. Are there ...
gradstudent's user avatar
  • 2,246
4 votes
1 answer
214 views

Rates of convergence to Tracy-Widom?

$\renewcommand{\!}{\mathbf} \renewcommand{\Ai}{\operatorname{Ai}}$ One can define the Tracy-Widom distribution as the Fredholm determinant $F_2(t)=\det(\mathbf I-\mathbf A)$ where $$\mathbf A(x, y)=\...
D.R.'s user avatar
  • 781
3 votes
0 answers
395 views

Sum of random permutation matrices

Let $A$ be a uniformly random $k\times k$ permutation matrix, and $A_1,\ldots, A_m$ be the $m$ independent copies of $A$. Here the uniform distribution is with respect to the $k!$ possible permutation ...
Minkov's user avatar
  • 1,127
7 votes
0 answers
179 views

Can one "smooth over" k-wise independence to get actual independence?

I came across the following toy problem and was curious if there was a simple solution or counterexample. Suppose you have a distribution $p$ on $m$ random variables $X_1, \ldots, X_m$, each with ...
untitled459's user avatar
7 votes
0 answers
216 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 $i$...
user51780's user avatar
  • 275