SearcharxivSearch

arXiv · 1809.11153

H\"older Continuity of Cumulative Distribution Functions for Noncommutative Polynomials under Finite Free Fisher Information

Abstract

This paper contributes to the current studies on regularity properties of noncommutative distributions in free probability theory. More precisely, we consider evaluations of selfadjoint noncommutative polynomials in noncommutative random variables that have finite non-microstates free Fisher information, highlighting the special case of Lipschitz conjugate variables. For the first time in this generality, it is shown that the analytic distributions of those evaluations have H\"older continuous cumulative distribution functions with an explicit H\"older exponent that depends only on the degree of the considered polynomial. For linear polynomials, we reach in the case of finite non-microstates free Fisher information the optimal H\"older exponent $\frac{2}{3}$, and get Lipschitz continuity in the case of Lipschitz conjugate variables. In particular, our results guarantee that such polynomial evaluations have finite logarithmic energy and thus finite (non-microstates) free entropy, which partially settles a conjecture of Charlesworth and Shlyakhtenko [CS16]. We further provide a very general criterion that gives for weak approximations of measures having H\"older continuous cumulative distribution functions explicit rates of convergence in terms of the Kolmogorov distance. Finally, we combine these results to study the asymptotic eigenvalue distributions of polynomials in GUEs or matrices with more general Gibbs laws. For Gibbs laws, this extends the corresponding result obtained in [GS09] from convergence in distribution to convergence in Kolmogorov distance; in the GUE case, we even provide explicit rates, which quantify results of [HT05,HST06] in terms of the Kolmogorov distance.

Explore related subjects

Keep this discovery

BibTeXRIS

Marwa Banna, Tobias Mai. 2018-09-28. H\"older Continuity of Cumulative Distribution Functions for Noncommutative Polynomials under Finite Free Fisher Information. https://arxiv.org/abs/1809.11153

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