Related papers: Tree convolution for probability distributions wit…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
The study of convolution powers of a finitely supported probability distribution $\phi$ on the $d$-dimensional square lattice is central to random walk theory. For instance, the $n$th convolution power $\phi^{(n)}$ is the distribution of…
We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
We study the distribution of the length of longest monotone subsequences in random (fixed-point free) involutions of $n$ integers as $n$ grows large, establishing asymptotic expansions in powers of $n^{-1/6}$ in the general case and in…
We investigate random Bernoulli convolutions, namely, probability measures given by the infinite convolution \[ \mu_\omega = \mathop{\circledast}_{k=1}^{\infty} \left( \frac{\delta_0 + \delta_{\lambda_1 \lambda_2 \ldots \lambda_{k-1}…
Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…
In this paper additive bi-free convolution is defined for general Borel probability measures, and the limiting distributions for sums of bi-free pairs of selfadjoint commuting random variables in an infinitesimal triangular array are…
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
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…
Based on a new analytical approach to the definition of additive free convolution on probability measures on the real line we prove free analogs of limit theorems for sums for non-identically distributed random variables in classical…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We derive new explicit bounds for the total variation distance between two convolution products of $n$ probability distributions, one of which having identical convolution factors. Approximations by finite signed measures of arbitrary order…
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
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 \mu one can define convolution powers with respect to free additive convolution and with…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…