Papers
Topics
Authors
Recent
Search
2000 character limit reached

A central limit theorem for star-generators of $S_{\infty}$, which relates to the law of a GUE matrix

Published 15 Jul 2018 in math.PR, math.CO, and math.OA | (1807.05633v4)

Abstract: It is well-known that, on a purely algebraic level, a simplified algebraic version of the Central Limit Theorem (CLT) can be proved in the framework of a noncommutative probability space, under the hypotheses that the sequence of non-commutative random variables we consider is exchangeable and obeys a certain vanishing condition of some of its joint moments. In this approach (which covers versions for both the classical CLT and the CLT of free probability), the determination of the resulting limit law has to be addressed on a case-by-case basis. In this paper we discuss an instance of the above theorem which takes place in the framework of the group algebra of the infinite symmetric group $S_{\infty}$: the exchangeable sequence that is considered consists of the star-generators of $S_{\infty}$, and the expectation functional used on the group algebra of $S_{\infty}$ depends in a natural way on a parameter $d$, which is a positive integer. We identify precisely the limit distribution $\mu_d$ for this special instance of exchangeable CLT, via a connection that $\mu_d$ turns out to have with the average empirical eigenvalue distribution of a random GUE matrix of size $d \times d$. Moreover, we put into evidence a multi-variate version of this result which follows from the observation that, on the level of calculations with pair-partitions, the (non-centred) star-generators are related to a (centred) exchangeable sequence of GUE matrices with independent entries

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.