Related papers: Tree convolution for probability distributions wit…
We study $N$-ary non-commutative notions of independence, which are given by trees and which generalize free, Boolean, and monotone independence. For every rooted subtree $\mathcal{T}$ of the $N$-regular tree, we define the…
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…
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…
We introduce the notion of a conditionally free product and conditionally free convolution. We describe this convolution both from a combinatorial point of view, by showing its connection with the lattice of non-crossing partitions, and…
We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible'…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…
We study mixtures of free, monotone, and Boolean independence described by a directed graph $G = (V,E)$ in the context of $\mathcal{T}$-free convolutions of Jekel and Liu. We prove general limit theorems for the associated additive…
We consider the free additive convolution $\mu_\alpha\boxplus\mu_\beta$ of two probability measures $\mu_\alpha$ and $\mu_\beta$, supported on respectively $n_\alpha$ and $n_\beta$ disjoint bounded intervals on the real line, and derive a…
This paper describes the quality of convergence to an infinitely divisible law relative to free multiplicative convolution. We show that convergence in distribution for products of identically distributed and infinitesimal free random…
We study the class $\mathcal{M}_{\mathrm{ratio}}$ of those probability distributions for which the free $R$-transforms are rational functions. This class is closed under the additive free convolution, additive free powers and under the…
Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…
We introduce a finite version of free probability and show the link between recent results using polynomial convolutions and the traditional theory of free probability. One tool for accomplishing this is a seemingly new transformation that…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
A new class of (not necessarily bounded) operators related to (mainly infinite) directed trees is introduced and investigated. Operators in question are to be considered as a generalization of classical weighted shifts, on the one hand, and…
We introduce and study a new type of convolution of probability measures called the orthogonal convolution, which is related to the monotone convolution. Using this convolution, we derive alternating decompositions of the free additive…
We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…