A simple proof for monotone CLT
classification
🧮 math.PR
math.OA
keywords
monotonesimplebeenbooleancasecasescentralclarifying
read the original abstract
In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it by making use of simple combinatorial structure of peakless pair partitions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.