Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Monotone, free, and boolean cumulants: a shuffle algebra approach (1701.06152v2)

Published 22 Jan 2017 in math.CO, math.FA, and math.PR

Abstract: The theory of cumulants is revisited in the "Rota way", that is, by following a combinatorial Hopf algebra approach. Monotone, free, and boolean cumulants are considered as infinitesimal characters over a particular combinatorial Hopf algebra. The latter is neither commutative nor cocommutative, and has an underlying unshuffle bialgebra structure which gives rise to a shuffle product on its graded dual. The moment-cumulant relations are encoded in terms of shuffle and half-shuffle exponentials. It is then shown how to express concisely monotone, free, and boolean cumulants in terms of each other using the pre-Lie Magnus expansion together with shuffle and half-shuffle logarithms.

Summary

We haven't generated a summary for this paper yet.