SearcharxivSearch

arXiv · 2006.15180

Characteristic polynomials of products of Wigner matrices: finite-N results and Lyapunov universality

Abstract

We compute the average characteristic polynomial of the hermitised product of $M$ real or complex Wigner matrices of size $N\times N$ and the average of the characteristic polynomial of a product of $M$ such Wigner matrices times the characteristic polynomial of the conjugate matrix. Surprisingly, the results agree with that of the product of $M$ real or complex Ginibre matrices at finite-$N$, which have i.i.d. Gaussian entries. For the latter the average characteristic polynomial yields the orthogonal polynomial for the singular values of the product matrix, whereas the product of the two characteristic polynomials involves the kernel of complex eigenvalues. This extends the result of Forrester and Gamburd for one characteristic polynomial of a single random matrix and only depends on the first two moments. In the limit $M\to\infty$ at fixed $N$ we determine the locations of the zeros of a single characteristic polynomial, rescaled as Lyapunov exponents by taking the logarithm of the $M$th root. The position of the $j$th zero agrees asymptotically for large-$j$ with the position of the $j$th Lyapunov exponent for products of Gaussian random matrices, hinting at the universality of the latter.

Explore related subjects

Keep this discovery

BibTeXRIS

Gernot Akemann, Friedrich Götze, Thorsten Neuschel. 2020-06-26. Characteristic polynomials of products of Wigner matrices: finite-N results and Lyapunov universality. https://doi.org/10.1214/21-ecp398

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