Free probability and combinatorics
Preprint
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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Continuous family of invariant subspaces for R-diagonal operatorsInventiones Mathematicae, 2001
- Representations of Symmetric Groups and Free ProbabilityAdvances in Mathematics, 1998
- Universality of Correlation Functions of Hermitian Random Matrices in an External FieldCommunications in Mathematical Physics, 1998
- Matrix integrals and map enumeration: An accessible introductionMathematical and Computer Modelling, 1997
- Multiplicative functions on the lattice of non-crossing partitions and free convolutionMathematische Annalen, 1994
- Transition probabilities for continual young diagrams and the Markov moment problemFunctional Analysis and Its Applications, 1993
- Limit laws for Random matrices and free productsInventiones Mathematicae, 1991
- Addition of certain non-commuting random variablesJournal of Functional Analysis, 1986
- Sur les partitions non croisees d'un cycleDiscrete Mathematics, 1972
- On the foundations of combinatorial theory I. Theory of M bius FunctionsProbability Theory and Related Fields, 1964