Free probability and combinatorics

Abstract

A combinatorial approach to free probability theory has been developped by Roland Speicher, based on the notion of noncrossing cumulants, a free analogue of the classical theory of cumulants in probability theory. We review this theory, and explain the connections between free probability theory and random matrices. We relate noncrossing cumulants to classical cumulants and also to characters of large symmetric groups. Finally we give applications to the asymptotics of representations of symmetric groups, specifically to the Littlewood-Richardson rule.

References in corpus (1)

• $R$-diagonal pairs - a common approach to Haar unitaries and circular elements

Cited by in corpus (6)

• Cumulants, free cumulants and half-shuffles
• Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations
• The combinatorics of Green's functions in planar field theories
• Symmetric groups and random matrices
• Groupes de réflexion, géométrie du discriminant et partitions non-croisées
• Combinatorics of asymptotic representation theory