Search arXivSearch

arXiv · 1909.04593

Hard Edge Statistics of Products of P\'olya Ensembles and Shifted GUE's

Abstract

Very recently, we have shown how the harmonic analysis approach can be modified to deal with products of general Hermitian and complex random matrices at finite matrix dimension. In the present work, we consider the particular product of a multiplicative P\'olya ensemble on the complex square matrices and a Gaussian unitary ensemble (GUE) shifted by a constant multiplicative of the identity. The shift shall show that the limiting hard edge statistics of the product matrix is weakly dependent on the local spectral statistics of the GUE, but depends more on the global statistics via its Stieltjes transform (Green function). Under rather mild conditions for the P\'olya ensemble, we prove formulas for the hard edge kernel of the singular value statistics of the P\'olya ensemble alone and the product matrix to highlight their very close similarity. Due to these observations, we even propose a conjecture for the hard edge statistics of a multiplicative P\'olya ensemble on the complex matrices and a polynomial ensemble on the Hermitian matrices.

Explore related subjects

Keep this discovery

BibTeXRIS

Mario Kieburg. 2019-09-10. Hard Edge Statistics of Products of P\'olya Ensembles and Shifted GUE's. https://doi.org/10.1016/j.jat.2022.105704

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