The norm of polynomials in large random and deterministic matrices

By C. Male. 2010

79 citations recorded by the source corpus.

Let $${{\bf X}_N =(X_1^{(N)}, \ldots, X_p^{(N)})}$$ be a family of N × N independent, normalized random matrices from the Gaussian Unitary Ensemble. We state sufficient conditions on matrices $${{\bf Y}_N =(Y_1^{(N)}, \ldots, Y_q^{(N)})}$$ , possibly random but independent of XN, for which the operator norm of $${P({\bf X}_N, {\bf Y}_N, {\bf 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 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.

Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/6b1be8476ec5361dbdc485580f2b7fc027d77652

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. M. Capitaine
  2. Florent Benaych-Georges
  3. M. Maida
  4. Ben Hayes
  5. Benoît Collins
  6. Alice Guionnet
  7. Antti Knowles
  8. Maxime Février

In Mathematical Physics

  1. Florent Benaych-Georges
  2. M. Capitaine
  3. M. Maida
  4. Alice Guionnet
  5. Andrea Montanari
  6. Benoît Collins
  7. Antti Knowles
  8. Delphine F'eral

In Statistics and Probability

  1. Florent Benaych-Georges
  2. M. Capitaine
  3. Alice Guionnet
  4. M. Maida
  5. Benoît Collins
  6. Antti Knowles
  7. Maxime Février
  8. Andrea Montanari

Citations in the corpus