Search arXivSearch

arXiv · 2412.20488

Free infinite divisibility, fractional convolution powers, and Appell polynomials

Abstract

Initiated by a result of Gorin and Marcus [Int. Math. Res. Not., (3):883--913, 2020] and an observation of Steinerberger [Proc. Amer. Math. Soc., 147(11):4733--4744, 2019], there has been a recent growing body of literature connecting repeated differentiation of polynomials to free additive convolution semigroups in free probability. Roughly, this connection states that in the large degree limit the empirical measure of the roots after many derivatives is, up to a rescaling, the original empirical measure of the roots raised to a free additive convolution power. If the original real roots satisfy some bounds and the number of derivatives is such that the remaining degree is fixed, then these high derivatives converge to the Hermite polynomials. In the context of convolution semigroups and finite free probability these results have a natural interpretation as a central limit theorem for repeated differentiation. We consider the case when these root bounds are removed and identify the potential limits of repeated differentiation as the real rooted Appell sequences. We prove that a sequence of polynomials is in the domain of attraction of an Appell sequence exactly when the empirical measures of the roots are, up to a rescaling, in the domain of attraction of a free infinitely divisible distribution naturally associated to the Appell sequence. We additionally extend these notions of infinite divisibility and fractional convolution semigroups to rectangular finite free probability. Our approach is based on the finite free R-transform of the polynomials, providing a step towards an analytic theory of finite free probability. These transforms provide a clear connection between Appell polynomials and free infinitely divisible distributions, where the finite free R-transform of a real rooted Appell polynomial is a truncated version of the R-transform of an infinitely divisible distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Campbell. 2025-12-18. Free infinite divisibility, fractional convolution powers, and Appell polynomials. https://arxiv.org/abs/2412.20488

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