We define a class of "algebraic" random matrices. These are random matrices for which the Stieltjes transform of the limiting eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner and Wishart matrices whose limiting eigenvalue distributions are given by the semi-circle law and the Marcenko-Pastur law are special cases. Algebraicity of a random matrix sequence is shown to act as a certificate of the computability of the limiting eigenvalue density function. The limiting moments of algebraic random matrix sequences, when they exist, are shown to satisfy a finite depth linear recursion so that they may often be efficiently enumerated in closed form.
In this article, we develop the mathematics of the polynomial method which allows us to describe the class of algebraic matrices by its generators and map the constructive approach we employ when proving algebraicity into a software implementation that is available for download in the form of the RMTool random matrix "calculator" package. Our characterization of the closure of algebraic probability distributions under free additive and multiplicative convolution operations allows us to simultaneously establish a framework for computational (non-commutative) "free probability" theory. We hope that the tools developed allow researchers to finally harness the power of the infinite random matrix theory.
We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries and unitary or orthogonal matrices.
We investigate the second-order correlation function of the characteristic polynomial of a sample covariance matrix. Starting from an explicit formula for the generating function, we re-obtain several well-known kernels from random matrix theory.
We give abstract versions of the large deviation theorem for the distribution of zeros of polynomials and apply them to the characteristic polynomials of Hermitian random matrices. We obtain new estimates related to the local semi-circular law for the empirical spectral distribution of these matrices when the 4th moments of their entries are controlled.
On the one hand, we prove that almost surely, for large dimension, there is no eigenvalue of a Hermitian polynomial in independent Wigner and deterministic matrices, in any interval lying at some distance from the supports of a sequence of deterministic probability measures, which is computed with the tools of free probability. On the other hand, we establish the strong asymptotic freeness of independent Wigner matrices and any family of deterministic matrices with strong limiting distribution.
We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the cumulants. From the latter, we read out the multivariate normal approximation to the traces of finite families of polynomials in independent complex Wishart matrices.
We provide a generalization and new proofs of the formulas of Collins, Hasebe and Sakuma for the spectrum of polynomials in cyclic monotone elements. This is applied to random matrices with discrete spectrum.
In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random matrix literature. As a consequence we derive the asymptotic spectral distribution of these matrices. The limit distribution has a density, which can be represented as the trace of an integral of densities of matrix measures corresponding to the C…
We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation group. We also look at some modifications of permutation matrices where the entries equal to one are replaced by i.i.d uniform variables on the unit circle. Once appropriately normalized and scaled, we show that the characteristic polynomial converges in distribution on every compact subset of $\mathbb{C}$ to an explicit limiting entire function, when the si…
In this paper we establish a connection between the fluctuations of Wishart random matrices, shifted Chebyshev polynomials, and planar diagrams whose linear span form a basis for the irreducible representations of the annular Temperly-Lieb algebra.
We prove a central limit theorem for the logarithm of the characteristic polynomial of random Jacobi matrices. Our results cover the G$β$E models for $β>0$.
We consider a square random matrix of size $N$ of the form $P(Y,A)$ where $P$ is a noncommutative polynomial, $A$ is a tuple of deterministic matrices converging in $\ast$-distribution, when $N$ goes to infinity, towards a tuple $a$ in some $\mathcal{C}^*$-probability space and $Y$ is a tuple of independent matrices with i.i.d. centered entries with variance $1/N$. We investigate the eigenvalues of $P(Y,A)$ outside the spectrum of $P(c,a)$ where $c$ is a circular system which is free from $a$. We provide a sufficient condition to guarantee that these eigenvalues coincide asymptotically with th…
We consider the sample covariance matrices of large data matrices which have i.i.d. complex matrix entries and which are non-square in the sense that the difference between the number of rows and the number of columns tends to infinity. We show that the second-order correlation function of the characteristic polynomial of the sample covariance matrix is asymptotically given by the sine kernel in the bulk of the spectrum and by the Airy kernel at the edge of the spectrum. Similar results are given for real sample covariance matrices.
It has been shown recently that the limit moments of $W(n)=B(n)B^{*}(n)$, where B(n) is a product of $p$ independent rectangular random matrices, are certain homogenous polynomials in the asymptotic dimensions of these matrices. Using the combinatorics of noncrossing partitions, we explicitly determine these polynomials and show that they are closely related to polynomials which can be viewed as multivariate Fuss-Narayana polynomials. Using this result, we compute the moments of the n-fold free multiplicative convolution of Marchenko-Pastur distributions with arbitrary shape parameters.
Let $p_n$ be the characteristic polynomial of an $n \times n$ random matrix drawn from one of the compact classical matrix groups. We show that the critical points of $p_n$ converge to the uniform distribution on the unit circle as $n$ tends to infinity. More generally, we show the same limit for a class of random polynomials whose roots lie on the unit circle. Our results extend the work of Pemantle-Rivin and Kabluchko to the setting where the roots are neither independent nor identically distributed.
We show that almost all the zeros of any finite linear combination of independent characteristic polynomials of random unitary matrices lie on the unit circle. This result is the random matrix analogue of an earlier result by Bombieri and Hejhal on the distribution of zeros of linear combinations of $L$-functions, thus providing further evidence for the conjectured links between the value distribution of the characteristic polynomial of random unitary matrices and the value distribution of $L$-functions on the critical line.
We propose a boundary regularity condition for the $M_n(\mathbb{C})$-valued subordination functions in free probability to prove the local limit theorem and delocalization of eigenvectors for polynomials in two random matrices. We prove this through estimating the pair of $M_n(\mathbb{C})$-valued approximate subordination functions for the sum of two $M_n(\mathbb{C})$-valued random matrices $γ_1\otimes C_N+γ_2\otimes U_N^*D_NU_N$, where $C_N$, $D_N$ are deterministic diagonal matrices, and $U_N$ is Haar unitary.
Let X_N= (X_1^(N), ..., X_p^(N)) 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_1^(N), ..., Y_q^(N)), 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 spectru…
We investigate the fluctuations around the mean of the Stieltjes transform of the empirical spectral distribution of any selfadjoint noncommutative polynomial in a Wigner matrix and a deterministic diagonal matrix. We obtain the convergence in distribution to a centred complex Gaussian process whose covariance is expressed in terms of operator-valued subordination functions.
In their paper, "A new application of random matrices: Ext(C*_red(F_2)) is not a group", Haagerup and Thorbjornsen prove an extension of Voiculescu's random matrix model for independent complex self-adjoint Gaussian random matrices. We generalize their result to random matrices with real or symplectic entries (the GOE- and the GSE-ensembles) and random matrix ensembles related to these.
We show that in the large matrix limit, the eigenvalues of the normal matrix model for matrices with spectrum inside a compact domain with a special class of potentials homogeneously fill the interior of a polynomial curve uniquely defined by the area of its interior domain and its exterior harmonic moments which are all given as parameters of the potential. Then we consider the orthogonal polynomials corresponding to this matrix model and show that, under certain assumptions, the density of the zeros of the highest relevant orthogonal polynomial in the large matrix limit is (up to some consta…
In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing structure, and the correlation functions are given in terms of a kernel. In the basic examples, the kernel is expressed in terms of orthogonal polynomials.
We investigate the asymptotic behaviour of the second-order correlation function of the characteristic polynomial of a Hermitian Wigner matrix at the edge of the spectrum. We show that the suitably rescaled second-order correlation function is asymptotically given by the Airy kernel, thereby generalizing the well-known result for the Gaussian Unitary Ensemble (GUE). Moreover, we obtain similar results for real-symmetric Wigner matrices.
A celebrated result of Karpelevi\v c describes $Θ_n,$ the collection of all eigenvalues arising from the stochastic matrices of order $n.$ The boundary of $Θ_n$ consists of roots of certain one-parameter families of polynomials, and those polynomials are naturally associated with the so--called reduced Ito polynomials of Types 0, I, II and III. In this paper we explicitly characterise all $n \times n$ stochastic matrices whose characteristic polynomials are of Type 0 or Type I, and all sparsest stochastic matrices of order $n$ whose characteristic polynomials are of Type II or Type III. The re…
Let $U^N = (U_1^N,\dots, U^N_p)$ be a d-tuple of $N\times N$ independent Haar unitary matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint non-commutative polynomial. In 1998, Voiculescu showed that the empirical measure of the eigenvalues of this polynomial evaluated in Haar unitary matrices and deterministic matrices converges towards a deterministic measure defined thanks to free probability theory. Let now $f$ be a smooth function, the main technical result of this paper is a precise bound of …
Motivated by recent results in random matrix theory we will study the distributions arising from products of complex Gaussian random matrices and truncations of Haar distributed unitary matrices. We introduce an appropriately general class of measures and characterize them by their moments essentially given by specific Jacobi polynomials with varying parameters. Solving this moment problem requires a study of the Riemann surfaces associated to a class of algebraic equations. The connection to random matrix theory is then established using methods from free probability.
We compute the average characteristic polynomial of the hermitised product of $M$ real or complex Wigner matrices of size $N\times N$ and the average of the characteristic polynomial of a product of $M$ such Wigner matrices times the characteristic polynomial of the conjugate matrix. Surprisingly, the results agree with that of the product of $M$ real or complex Ginibre matrices at finite-$N$, which have i.i.d. Gaussian entries. For the latter the average characteristic polynomial yields the orthogonal polynomial for the singular values of the product matrix, whereas the product of the two cha…
Formulae of Plancherel-Rotach type are established for the average characteristic polynomials of certain Hermitian products of rectangular Ginibre random matrices on the region of zeros. These polynomials form a general class of multiple orthogonal hypergeometric polynomials generalizing the classical Laguerre polynomials. The proofs are based on a multivariate version of the complex method of saddle points. After suitable rescaling the asymptotic zero distributions for the polynomials are studied and shown to coincide with the Fuss-Catalan distributions. Moreover, introducing appropriate coor…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the matrix-size tends to infinity in terms of the volumes of certain regions involving continuous Gelfand-Tsetlin patterns with constraints. The results we find differ from those in the unitary case considered previously
