SearcharxivSearch

arXiv · 1612.07041

Asymptotic distributions of Wishart type products of random matrices

Abstract

We study asymptotic distributions of large dimensional random matrices of the form $BB^{*}$, where $B$ is a product of $p$ rectangular random matrices, using free probability and combinatorics of colored labeled noncrossing partitions. These matrices are taken from the set of off-diagonal blocks of the family $\mathcal{Y}$ of independent Hermitian random matrices which are asymptotically free, asymptotically free against the family of deterministic diagonal matrices, and whose norms are uniformly bounded almost surely. This class includes unitarily invariant Hermitian random matrices with limit distributions given by compactly supported probability measures $ν$ on the real line. We express the limit moments in terms of colored labeled noncrossing pair partitions, to which we assign weights depending on even free cumulants of $ν$ and on asymptotic dimensions of blocks (Gaussianization). For products of $p$ independent blocks, we show that the limit moments are linear combinations of a new family of polynomials called generalized multivariate Fuss-Narayana polynomials. In turn, the product of two blocks of the same matrix leads to an example with rescaled Raney numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Romuald Lenczewski, Rafał Sałapata. 2017-02-16. Asymptotic distributions of Wishart type products of random matrices. https://doi.org/10.4064/cm7240-1-2018

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