A simple proof for monotone CLT

DOI10.1142/S0219025710004073MaRDI QIDQ3580212zbMATH OpenOpenAlexFDO

Authors Hayato Saigo

Publication date 11 August 2010

Published in Infinite Dimensional Analysis, Quantum Probability and Related Topics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.3728

zbMATH Keywords

central limit theoremmonotone independencepeakless pair partitions

Mathematics Subject Classification ID

Noncommutative probability and statistics (46L53)

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.

Recommendations

• MONOTONIC INDEPENDENCE, MONOTONIC CENTRAL LIMIT THEOREM AND MONOTONIC LAW OF SMALL NUMBERS
• The monotone cumulants
• MONOTONIC INDEPENDENCE ASSOCIATED WITH PARTIALLY ORDERED SETS
• Monotonic approach to central limits
• A proof of the central limit theorem for c-free quantum random variables

Cites work

• MONOTONIC INDEPENDENCE, MONOTONIC CENTRAL LIMIT THEOREM AND MONOTONIC LAW OF SMALL NUMBERS
• Noncommutative Brownian motion in monotone Fock space
• ON A CENTRAL LIMIT THEOREM FOR MONOTONE NOISE
• THE FIVE INDEPENDENCES AS NATURAL PRODUCTS
• THE FIVE INDEPENDENCES AS QUASI-UNIVERSAL PRODUCTS
• Unification of Boolean, monotone, anti-monotone, and tensor independence and Lévy processes

Cited in

(3)

• Conditionally monotone independence I: Independence, additive convolutions and related convolutions
• The monotone cumulants
• A new look at the arcsine law and ``quantum-classical correspondence

This page was built for publication: A simple proof for monotone CLT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580212)