Search arXivSearch

arXiv · 1203.4780

k-Divisible random variables in free probability

Abstract

We introduce and study the notion of k-divisible elements in a non-commutative probability space. A k-divisible element is a (non-commutative) random variable whose n-th moment vanishes whenever n is not a multiple of k. First, we consider the combinatorial convolution \ast in the lattices NC of non-crossing partitions and NC^k of k-divisible non-crossing partitions and show that convolving k times with the zeta-function in NC is equivalent to convolving once with the zeta-function in NC^k. Furthermore, when x is k-divisible, we derive a formula for the free cumulants of x^k in terms of the free cumulants of x, involving k-divisible non-crossing partitions. Second, we prove that if a and s are free and s is k-divisible then sps and a are free, whenever p is any polynomial (on a and s) of degree k - 2 on s. Moreover, we define a notion of R-diagonal k-tuples and prove similar results. Next, we show that free multiplicative convolution between a measure concentrated in the positive real line and a probability measure with k-symmetry is well defined. Analytic tools to calculate this convolution are developed. Finally, we concentrate on free additive powers of k-symmetric distributions and prove that μt is a well defined probability measure, for all t > 1. We derive central limit theorems and Poisson type ones. More generally, we consider freely infinitely divisible measures and prove that free infinite divisibility is maintained under the mapping μ\rightarrow μ^k . We conclude by focusing on (k-symmetric) free stable distributions, for which we prove a reproducing property generalizing the ones known for one sided and real symmetric free stable laws.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Octavio Arizmendi. 2012-03-21. k-Divisible random variables in free probability. https://arxiv.org/abs/1203.4780

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR