SearcharxivSearch

arXiv · 2005.08899

Non-asymptotic Results for Singular Values of Gaussian Matrix Products

Abstract

This article concerns the non-asymptotic analysis of the singular values (and Lyapunov exponents) of Gaussian matrix products in the regime where $N,$ the number of term in the product, is large and $n,$ the size of the matrices, may be large or small and may depend on $N$. We obtain concentration estimates for sums of Lyapunov exponents, a quantitative rate of convergence of the empirical measure of the normalized squared singular values to the uniform distribution on $[0,1]$, and results on the joint normality of Lyapunov exponents when $N$ is sufficiently large as a function of $n.$ Our technique consists of non-asymptotic versions of the ergodic theory approach at $N=\infty$ due originally to Furstenberg and Kesten in the 1960's, which were then further developed by Newman and Isopi-Newman as well as by a number of other authors in the 1980's. Our key technical idea is that small ball probabilities for volumes of random projections give a way to quantify convergence in the multiplicative ergodic theorem for random matrices.

Explore related subjects

Keep this discovery

BibTeXRIS

Boris Hanin, Grigoris Paouris. 2020-05-18. Non-asymptotic Results for Singular Values of Gaussian Matrix Products. https://arxiv.org/abs/2005.08899

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