Papers
Topics
Authors
Recent
Search
2000 character limit reached

A simple proof of almost sure convergence for the largest singular value of a product of Gaussian matrices

Published 30 Sep 2024 in math.PR | (2409.20180v2)

Abstract: Let m≥1m \geq 1 and consider the product of mm independent n×nn \times n matrices W=W<em>1…Wm\mathbf{W} = \mathbf{W}<em>1 \dots \mathbf{W}_m, each W</em>i\mathbf{W}</em>{i} with i.i.d. normalised N(0,n<sup>−1/2)\mathcal{N}(0, n<sup>{-1/2}) entries. It is shown in Penson et al. (2011) that the empirical distribution of the squared singular values of W\mathbf{W} converges to a deterministic distribution compactly supported on [0,um][0, u_m], where um=(m+1)<sup>m+1m<sup>mu_m = \frac{{(m+1)}<sup>{m+1}}{m<sup>m}. This generalises the well-known case of m=1m=1, corresponding to the Marchenko-Pastur distribution for square matrices. Moreover, for m=1m=1, it was first shown by Geman (1980) that the largest squared singular value almost surely converges to the right endpoint (the so-called ``soft edge'') of the support, i.e. s1<sup>2(W)</sup>→a.s.u1s_1<sup>2(\mathbf{W})</sup> \xrightarrow{a.s.} u_1. Herein, we present a proof for the general case s1<sup>2(W)</sup>→a.s.ums_1<sup>2(\mathbf{W})</sup> \xrightarrow{a.s.} u_m for m≥1m\geq 1. Although we do not claim novelty for our result, the proof is simple and does not require familiarity with modern techniques of free probability.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.