The norm of polynomials in large random and deterministic matrices

42Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let XN = (X1(N), . . . , Xp(N)) be a family of N × N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices YN = (Y1(N), . . . , Yq(N)), possibly random but independent of XN, for which the operator norm of P(XN, YN, YN*) converges almost surely for all polynomials P. Limits are described by operator norms of objects from free probability theory. Taking advantage of the choice of the matrices YN and of the polynomials P, we get for a large class of matrices the "no eigenvalues outside a neighborhood of the limiting spectrum" phenomena. We give examples of diagonal matrices YN for which the convergence holds. Convergence of the operator norm is shown to hold for block matrices, even with rectangular Gaussian blocks, a situation including non-white Wishart matrices and some matrices encountered in MIMO systems. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Male, C. (2012). The norm of polynomials in large random and deterministic matrices. Probability Theory and Related Fields, 154(3–4), 477–532. https://doi.org/10.1007/s00440-011-0375-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free