Spectra of random linear combinations of matrices defined via representations and Coxeter generators of the symmetric group
Abstract
We consider the asymptotic behavior as n∞ of the spectra of random matrices of the form \[1n-1Σk=1n-1Znkn ((k,k+1)),\] where for each n the random variables Znk are i.i.d. standard Gaussian and the matrices n((k,k+1)) are obtained by applying an irreducible unitary representation n of the symmetric group on \1,2,...,n\ to the transposition (k,k+1) that interchanges k and k+1 [thus, n((k,k+1)) is both unitary and self-adjoint, with all eigenvalues either +1 or -1]. Irreducible representations of the symmetric group on \1,2,...,n\ are indexed by partitions λn of n. A consequence of the results we establish is that if λn,1λn,2...0 is the partition of n corresponding to n, μn,1μn,2 >...0 is the corresponding conjugate partition of n (i.e., the Young diagram of μn is the transpose of the Young diagram of λn), n∞λn,in=pi for each i1, and n∞μn,jn=qj for each j1, then the spectral measure of the resulting random matrix converges in distribution to a random probability measure that is Gaussian with random mean θ Z and variance 1-θ2, where θ is the constant Σipi2-Σjqj2 and Z is a standard Gaussian random variable.
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.