SearcharxivSearch

arXiv · 2407.19233

Exchangeable arrays and integrable systems for characteristic polynomials of random matrices

Abstract

The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied intensively in the past twenty five years, partly in relation to conjectural connections to the Riemann zeta-function and Hardy's function. We completely settle the most general version of the problem of convergence of these joint moments, after they are suitably rescaled, for an arbitrary number of derivatives and with arbitrary positive real exponents. Our approach relies on a hidden, higher-order exchangeable structure, that of an exchangeable array. Using these probabilistic techniques, we then give a combinatorial formula for the leading order coefficient in the asymptotics of the joint moments, when the power on the characteristic polynomial itself is a positive real number and the exponents of the derivatives are integers, in terms of a finite number of finite-dimensional integrals which are explicitly computable. Finally, we develop a method, based on a class of Hankel determinants shifted by partitions, that allows us to give an exact representation of all these joint moments, for finite matrix size, in terms of derivatives of Painlev\'e V transcendents, and then for the leading order coefficient in the large-matrix limit in terms of derivatives of solutions of the $\sigma$-Painlev\'e III' equation. Equivalently, we can represent all the joint moments of power sum linear statistics of a certain determinantal point process behind this problem in terms of derivatives of $\sigma$-Painlev\'e III' transcendents. This gives an efficient way to compute all these quantities explicitly. Our methods can be used to obtain analogous results for a number of other models sharing the same features.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Theodoros Assiotis, Mustafa Alper Gunes, Jonathan P. Keating, Fei Wei. 2024-07-27. Exchangeable arrays and integrable systems for characteristic polynomials of random matrices. https://arxiv.org/abs/2407.19233

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