The limiting characteristic polynomial of classical random matrix ensembles

From MaRDI portal
Publication:1735499



Abstract: We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the Gaussian Unitary Ensemble. In fact, the result is the by-product of a general limit theorem for the convergence of random entire functions whose zeros present a simple regularity property.


The determinantal point process with sine kernel, called sine process, is of main interest in random matrix theory. It was shown in [the first author et al., Invent. Math. 207, No. 1, 23--113 (2017; Zbl 1368.11098)] that the sequence of characteristic polynomials associated to the group of unitary matrices endowed with Haar measure converges in distribution to a limiting random universal function simply deriving from the sine process. In this paper, the authors extend convergence to a larger class of sequences of random entire functions. Examples of application concern random orthogonal matrices, random symplectic matrices and the Gaussian unitary ensemble. The result in this last case is not new but the new proof provides new estimates.











This page was built for publication: The limiting characteristic polynomial of classical random matrix ensembles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735499)