Strong Convergence for a General Class of Random Matrix Models
Yanjin Xiang, Zhihua Zhang
Abstract
Let \(X1,n,…,Xd,n\) be \(n× n\) random matrices built from independent i.i.d. entry arrays, with centered entries, normalized by \(n-1/2\). We prove that, if every entry law has finite fourth moment, then this tuple converges almost surely strongly in \(*\)-distribution to a free circular family with the matching variances. Equivalently, normalized traces and operator norms converge for every fixed noncommutative \(*\)-polynomial, including polynomials with fixed matrix coefficients. No assumption is imposed on the pseudo-variances of the complex entries. The bounded-entry argument applies the spectrum and moment universality estimates of Brailovskaya and van Handel to all self-adjoint linear pencils. The matching Gaussian pencils are reduced to independent Wigner matrices and identified by Anderson's strong convergence theorem. A fixed-level centered truncation, followed by the Bai--Yin norm bound, transfers the result to finite fourth moments.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.