Random truncations of Haar distributed matrices and bridges
Abstract
Let U be a Haar distributed matrix in U(n) or O (n). In a previous paper, we proved that after centering, the two-parameter process \[T(n) (s,t) = Σi ≤ ns , j ≤ nt |Uij|2\] converges in distribution to the bivariate tied-down Brownian bridge. In the present paper, we replace the deterministic truncation of U by a random one, where each row (resp. column) is chosen with probability s (resp. t) independently. We prove that the corresponding two-parameter process, after centering and normalization by n-1/2 converges to a Gaussian process. On the way we meet other interesting convergences.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.