SearcharxivSearch

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

BibTeXRIS

Andrew Campbell. 2024-12-29. 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

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR