Central limit theorems for the real eigenvalues of large Gaussian random matrices
Abstract
Let G be an N × N real matrix whose entries are independent identically distributed standard normal random variables Gij N(0,1). The eigenvalues of such matrices are known to form a two-component system consisting of purely real and complex conjugated points. The purpose of this note is to show that by appropriately adapting the methods of KPTTZ15, we can prove a central limit theorem of the following form: if λ1,…,λNR are the real eigenvalues of G, then for any even polynomial function P(x) and even N=2n, we have the convergence in distribution to a normal random variable equation 1E(NR)(Σj=1NRP(λj)-EΣj=1NRP(λj)) N(0,σ2(P)) equation as n ∞, where σ2(P) = 2-22∫-11P(x)2\,dx.
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.