Monotone and Boolean Convolutions for Non-compactly Supported Probability Measures
arXiv:math/0703408 · doi:10.1512/iumj.2009.58.3578
Abstract
The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the multiplicative boolean convolution of probability measures on the positive half-line is proposed. Unlike Bercovici's multiplicative boolean convolution it is always defined, but it turns out to be neither commutative nor associative. Finally some relations between free, monotone, and boolean convolutions are discussed.
32 pages, new Lemma 2.1
References in corpus (2)
Cited by in corpus (12)
- Monotone Increment Processes, Classical Markov Processes, and Loewner Chains
- Free infinite divisibility for beta distributions and related ones
- Convolution, subordination and characterization problems in noncommutative probability
- An Operad of Non-commutative Independences Defined by Trees
- Limit theorems for free Lévy processes
- Free Subordination and Belinschi-Nica Semigroup
- Extended de Finetti theorems for boolean independence and monotone independence
- A noncommutative De Finetti theorem for boolean independence
- Generators of some non-commutative stochastic processes
- Additive processes on the unit circle and Loewner chains
- Relations between convolutions and transforms in operator-valued free probability
- Loewner's Differential Equation and Spidernets