2000 character limit reached
Bridges and random truncations of random matrices (1312.2382v1)
Published 9 Dec 2013 in math.PR
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.