Free cumulants and enumeration of connected partitions

Abstract

A combinatorial formula is derived which expresses free cumulants in terms of classical comulants. As a corollary, we give a combinatorial interpretation of free cumulants of classical distributions, notably Gaussian and Poisson distributions. The latter count connected pairings and connected set partitions respectively. The proof relies on Moebius inversion on the partition lattice.

arXiv comment7 pages, AMSLaTeX

References in corpus (1)

• $q$-Gaussian processes: non-commutative and classical aspects

Cited by in corpus (10)

• Relations between cumulants in noncommutative probability
• The normal distribution is $⊞$-infinitely divisible
• Monotone, free, and boolean cumulants: a shuffle algebra approach
• Cumulants of the q-semicircular law, Tutte polynomials, and heaps
• About the foundation of the Kubo Generalized Cumulants theory. A revisited and corrected approach
• Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations
• Boolean Cumulants and Subordination in Free Probability
• Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants
• A Berry-Essen Type Theorem for Finite Free Convolution
• On matrices in finite free position