SearcharxivSearch

arXiv · 1707.00449

Mod-Gaussian convergence for random determinants and random characteristic polynomials

Abstract

The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles and random characteristic polynomials evaluated at 1 for matrices in the Circular and Circular Jacobi beta ensembles. We use the framework of mod-Gaussian convergence to provide quantitative estimates of their logarithmic behavior, as the size of the ensemble grows to infinity. We establish central limit theorems, Berry-Esseen bounds, moderate deviations and local limit theorems. Furthermore, we identify the scale at which the validity of the Gaussian approximation for the tails breaks. With the exception of the Gaussian ensemble, all the results are obtained for a continuous choice of the Dyson parameter, that is for general $β>0$. The proofs rely on explicit computations which are possible thanks to closed product formulas of the Laplace transforms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martina Dal Borgo, Emma Hovhannisyan, Alain Rouault. 2017-07-24. Mod-Gaussian convergence for random determinants and random characteristic polynomials. https://arxiv.org/abs/1707.00449

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