Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The norm of polynomials in large random and deterministic matrices (1004.4155v5)

Published 23 Apr 2010 in math.PR and math.OA

Abstract: Let X_N= (X_1N, ..., X_pN) be a family of N-by-N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices Y_N =(Y_1N, ..., Y_qN), possibly random but independent of X_N, for which the operator norm of P(X_N, Y_N, Y_N*) 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 Y_N 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 Y_N 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.

Summary

We haven't generated a summary for this paper yet.