arXiv 1007.00582010-07math.OAmath.PR

Infinite divisibility and a non-commutative Boolean-to-free Bercovici-Pata bijection

Serban T. Belinschi, Mihai Popa, Victor Vinnikov

备注：: 26 pages, LaTeX

英文摘要：

We use the theory of fully matricial, or non-commutative, functions to investigate infinite divisibility and limit theorems in operator-valued non-commutative probability. Our main result is an operator-valued analogue of the Bercovici-Pata bijection. An important tool is Voiculescu's subordination property for operator-valued free convolution.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Operator-Valued Monotone Convolution Semigroups and an Extension of the Bercovici-Pata Bijection

In a 1999 paper, Bercovici and Pata showed that a natural bijection between the classically, free and Boolean infinitely divisible measures held at the level of limit theorems of triangular arrays. This result was extended to include monotone convolution by the authors. In recent years, operator-valued versions of free, Boolean and monotone probability have also been developed. Belinschi, Popa and Vinnikov showed that the Bercovici-Pata bijection holds for the operator-valued versions of free and Boolean probability. In this article, we extend the bijection to include monotone probability theo…

2015-05-19math.OAmath.PR

Eta-series and a Boolean Bercovici-Pata bijection for bounded k-tuples

On the space of (non-commutative) distributions of k-tuples of selfadjoint elements in a $C^*$-probability space $D_c(k)$, one has an operation $\freeplus$ of free additive convolution, and one can consider the subspace $D_c^{inf-div}$ of distributions which are infinitely divisible with respect to this operation. The linearizing transform for free additive convolution is the R-transform. Thus, one has $R_{μ\freeplusν}=R_μ+R_ν$. The eta-series $η_μ$ is the counterpart of $R_μ$ in the theory of Boolean convolution. We prove that the space of eta-series of distributions belonging to $D_c(k)$ coi…

2007-06-25math.COmath.OA

Limit theorems for monotonic convolution and the Chernoff product formula

Bercovici and Pata showed that the correspondence between classically, freely, and Boolean infinitely divisible distributions holds on the level of limit theorems. We extend this correspondence also to distributions infinitely divisible with respect to the additive monotone convolution. Because of non-commutativity of this convolution, we use a new technique based on the Chernoff product formula. In fact, the correspondence between the Boolean and monotone limit theorems extends from probability measures to positive measures of total weight at most one. Finally, we study this correspondence fo…

2013-02-19math.OAmath.PR

Matricial model for the free multiplicative convolution

This paper investigates homomorphisms à la Bercovici-Pata between additive and multiplicative convolutions. We also consider their matricial versions which are associated with measures on the space of Hermitian matrices and on the unitary group. The previous results combined with a matricial model of Benaych-Georges and Cabanal-Duvillard allows us to define and study the large N limit of a new matricial model on the unitary group for free multiplicative Lévy processes.

2014-02-21math.OAmath.PR

Relations between infinitesimal non-commutative cumulants

Boolean, free and monotone cumulants as well as relations among them, have proven to be important in the study of non-commutative probability theory. Quite notably, Boolean cumulants were successfully used to study free infinite divisibility via the Boolean Bercovici--Pata bijection. On the other hand, in recent years the concept of infinitesimal non-commutative probability has been developed, together with the notion of infinitesimal cumulants which can be useful in the context of combinatorial questions. In this paper, we show that the known relations among free, Boolean and monotone cumulan…

2021-08-23math.COmath.OAmath.PR

Semigroups related to additive and multiplicative, free and Boolean convolutions

Belinschi and Nica introduced a composition semigroup on the set of probability measures. Using this semigroup, they introduced a free divisibility indicator, from which one can know whether a probability measure is freely infinitely divisible or not. In this paper we further investigate this indicator, introduce a multiplicative version of it and are able to show many properties. Specifically, on the first half of the paper, we calculate how the indicator changes with respect to free and Boolean powers; we prove that free and Boolean 1/2-stable laws have free divisibility indicators equal to …

2013-06-03math.OAmath.PR

更多相关论文收起更多论文

Convolution powers in the operator-valued framework

We consider the framework of an operator-valued noncommutative probability space over a unital C*-algebra B. We show how for a B-valued distribution μone can define convolution powers with respect to free additive convolution and with respect to Boolean convolution, where the exponent considered in the power is a suitably chosen linear map ηfrom B to B, instead of being a non-negative real number. More precisely, the Boolean convolution power is defined whenever ηis completely positive, while the free additive convolution power is defined whenever η- 1 is completely positive (where 1 stands fo…

2011-07-14math.OAmath.PR

Appell polynomials and their relatives II. Boolean theory

The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the other two being free and tensor/classical probability). The basic properties of the Boolean Appell polynomials are described. In particular, their generating function turns out to have a resolvent-type form, just like the generating function for the free Sheffer polynomials. It follows that the Meixner (that is, Sheffer plus orthogonal) polynomial classes, …

2007-12-27math.COmath.OA