SearcharxivSearch

arXiv · 2012.11993

Cyclic P\'olya Ensembles on the Unitary Matrices and their Spectral Statistics

Abstract

The framework of spherical transforms and P\'olya ensembles is of utility in deriving structured analytic results for sums and products of random matrices in a unified way. In the present work, we will carry over this framework to study products of unitary matrices. Those are not distributed via the Haar measure, but still are drawn from distributions where the eigenvalue and eigenvector statistics factorise. They include the circular Jacobi ensemble, known in relation to the Fisher-Hartwig singularity in the theory of Toeplitz determinants, as well as the heat kernel for Brownian motion on the unitary group. We define cyclic P\'olya frequency functions and show their relation to the cyclic P\'olya ensembles, give a uniqueness statement for the corresponding weights, and derive the determinantal point processes of the eigenvalue statistics at fixed matrix dimension. An outline is given of problems one may encounter when investigating the local spectral statistics.

Explore related subjects

Keep this discovery

BibTeXRIS

Mario Kieburg, Shi-Hao Li, Jiyuan Zhang, Peter J. Forrester. 2020-12-22. Cyclic P\'olya Ensembles on the Unitary Matrices and their Spectral Statistics. https://doi.org/10.1007/s00365-023-09630-8

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