SearcharxivSearch

arXiv · 2010.16083

Local laws for multiplication of random matrices

Abstract

Consider the random matrix model $A^{1/2} UBU^* A^{1/2},$ where $A$ and $B$ are two $N \times N$ deterministic matrices and $U$ is either an $N \times N$ Haar unitary or orthogonal random matrix. It is well-known that on the macroscopic scale, the limiting empirical spectral distribution (ESD) of the above model is given by the free multiplicative convolution of the limiting ESDs of $A$ and $B,$ denoted as $\mu_\alpha \boxtimes \mu_\beta,$ where $\mu_\alpha$ and $\mu_\beta$ are the limiting ESDs of $A$ and $B,$ respectively. In this paper, we study the asymptotic microscopic behavior of the edge eigenvalues and eigenvectors statistics. We prove that both the density of $\mu_A \boxtimes \mu_B,$ where $\mu_A$ and $\mu_B$ are the ESDs of $A$ and $B,$ respectively and the associated subordination functions have a regular behavior near the edges. Moreover, we establish the local laws near the edges on the optimal scale. In particular, we prove that the entries of the resolvent are close to some functionals depending only on the eigenvalues of $A, B$ and the subordination functions with optimal convergence rates. Our proofs and calculations are based on the techniques developed for the additive model $A+UBU^*$ in [3,5,6,8], and our results can be regarded as the counterparts of [8] for the multiplicative model.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiucai Ding, Hong Chang Ji. 2020-10-30. Local laws for multiplication of random matrices. https://arxiv.org/abs/2010.16083

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