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
- M. Capitaine
- Florent Benaych-Georges
- M. Maida
- Ben Hayes
- Benoît Collins
- Alice Guionnet
- Antti Knowles
- Maxime Février
In Mathematical Physics
- Florent Benaych-Georges
- M. Capitaine
- M. Maida
- Alice Guionnet
- Andrea Montanari
- Benoît Collins
- Antti Knowles
- Delphine F'eral
In Statistics and Probability
- Florent Benaych-Georges
- M. Capitaine
- Alice Guionnet
- M. Maida
- Benoît Collins
- Antti Knowles
- Maxime Février
- Andrea Montanari
Citations in the corpus
- Random matrix techniques in quantum information theory (2015, background): “the strong convergence in the theorem below has has been proved by analytic tools such as determinantal point processes. Let us also record it as a direct consequence of the much more general results [Mal12]. Theorem 3.2. Consider a sequence s dof positive integers which behaves as s d˘cdas d!1, for”
- A random matrix approach to the Peterson-Thom conjecture (2020, methodology): “for a mixture of deterministic and random matrices see [49, 16]) involve replacing some coordinates of the tuple with their strong limits.”
- Fluctuations of the Extreme Eigenvalues of Finite Rank Deformations of Random Matrices (2010, background): “ely a Hermitian matrix X n with independent Gaussian centred entries so that E[jX ijj2] = n 1˙(i=n;j=n) with a stepwise constant function ˙(x;y) = Xk i;j=1 1 i 1 k x<i k i i1 k y< k ˙ i;j: In [31], matrices of the form S n= P k(k+1) j=1 a j X (n) with some independent matrices X(n) from the GU”
- Free Convolution with a Semicircular Distribution and Eigenvalues of Spiked Deformations of Wigner Matrices (2010, background): “Moreover, the recent results of [26] (which investigate several matrices in a free probability context) imply that the operator norm (i.”
- The spectral norm of random inner-product kernel matrices (2015, background): “When W is GUE and V has no spike eigenvalues, the results of [16, 41] imply that the eigenvalues of W + V stick to the limiting support, and the fluctuations of the eigenvalues at the edges of the support are also understood in various settings [48, 17, 39].”