Bridges and random truncations of random matrices
classification
🧮 math.PR
keywords
processrandomcenteringconvergesrescalingsubmatrixtimesanother
read the original abstract
We continue to study the squared Frobenius norm of a submatrix of a $n \times n$ random unitary matrix. When the choice of the submatrix is deterministic and its size is $[ns] \times [nt]$, we proved in a previous paper that, after centering and without any rescaling, the two-parameter process converges in distribution to a bivariate Brownian bridge. Here, we consider Bernoulli independent choices of rows and columns with respective parameters $s$ and $t$. We prove by subordination that after centering and rescaling by $n^{-1/2}$, the process converges to another Gaussian process.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.