Rate of convergence of linear functions on the unitary group

Abstract

We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 + b}), with 0 <= b < 1, depending only on the asymptotic behaviour of the singular values of A; for example, if the singular values are non-degenerate, different from zero and O(1) as N -> infinity, then b=0. The proof uses a Berry-Esse'en inequality for linear combinations of eigenvalues of random unitary, matrices, and so appropriate for strongly dependent random variables.

34 pages, 1 figure; corrected typos, added remark 3.3, added 3 references

Cited by in corpus (9)

• Jucys-Murphy Elements and Unitary Matrix Integrals
• On the Rate of Convergence in the Central Limit Theorem for Linear Statistics of Gaussian, Laguerre, and Jacobi Ensembles
• On the moments of characteristic polynomials
• Speed of convergence in the Central Limit Theorem for the determinantal point process with the Bessel kernel
• Random matrices with prescribed eigenvalues and expectation values for random quantum states
• Derived Langlands III: PSH algebras and their numerical invariants
• Symmetric Function Theory and Unitary Invariant Ensembles
• Derived Langlands VI: Monomial resolutions and $2$-variable L-functions
• Derived Langlands V:The simplicial and Hopflike categories