English

Tree convolution for probability distributions with unbounded support

Operator Algebras 2021-04-13 v2 Probability

Abstract

We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020), which generalize the free, boolean, monotone, and orthogonal convolutions. In particular, for each rooted subtree T\mathcal{T} of the NN-regular tree (with vertices labeled by alternating strings), we define the convolution T(μ1,,μN)\boxplus_{\mathcal{T}}(\mu_1,\dots,\mu_N) for arbitrary probability measures μ1\mu_1, ..., μN\mu_N on R\mathbb{R} using a certain fixed-point equation for the Cauchy transforms. The convolution operations respect the operad structure of the tree operad from doi:10.4064/dm797-6-2020. We prove a general limit theorem for iterated T\mathcal{T}-free convolution similar to Bercovici and Pata's results in the free case in "Stable laws and domains of attraction in free probability" (Annals of Mathematics, 1999, doi:10.2307/121080), and we deduce limit theorems for measures in the domain of attraction of each of the classical stable laws.

Keywords

Cite

@article{arxiv.2102.01214,
  title  = {Tree convolution for probability distributions with unbounded support},
  author = {Ethan Davis and David Jekel and Zhichao Wang},
  journal= {arXiv preprint arXiv:2102.01214},
  year   = {2021}
}

Comments

34 pages, 3 figures

R2 v1 2026-06-23T22:44:45.646Z