We discuss the product of M rectangular random matrices with independent Gaussian entries, which have several applications, including wireless telecommunication and econophysics. For complex matrices an explicit expression for the joint probability density function is obtained using the Harish-Chandra-Itzykson-Zuber integration formula. Explicit expressions for all correlation functions and moments for finite matrix sizes are obtained using a two-matrix model and the method of biorthogonal polynomials. This generalizes the classical result for the so-called Wishart-Laguerre Gaussian unitary ensemble (or chiral unitary ensemble) at M=1, and previous results for the product of square matrices. The correlation functions are given by a determinantal point process, where the kernel can be expressed in terms of Meijer G-functions. We compare the results with numerical simulations and known results for the macroscopic level density in the limit of large matrices. The location of the end points of support for the latter are analyzed in detail for general M. Finally, we consider the so-called ergodic mutual information, which gives an upper bound for the spectral efficiency of a MIMO communication channel with multifold scattering.

We study the joint probability density of the eigenvalues of a product of rectangular real, complex or quaternion random matrices in a unified way. The random matrices are distributed according to arbitrary probability densities, whose only restriction is the invariance under left and right multiplication by orthogonal, unitary or unitary symplectic matrices, respectively. We show that a product of rectangular matrices is statistically equivalent to a product of square matrices. Hereby we prove a weak commutation relation of the random matrices at finite matrix sizes, which previously have been discussed for infinite matrix size. Moreover we derive the joint probability densities of the eigenvalues. To illustrate our results we apply them to a product of random matrices drawn from Ginibre ensembles and Jacobi ensembles as well as a mixed version thereof. For these weights we show that the product of complex random matrices yield a determinantal point process, while the real and quaternion matrix ensembles correspond to Pfaffian point processes. Our results are visualized by numerical simulations. Furthermore, we present an application to a transport on a closed, disordered chain coupled to a particle bath.

In this review we summarise recent results for the complex eigenvalues and singular values of finite products of finite size random matrices, their correlation functions and asymptotic limits. The matrices in the product are taken from ensembles of independent real, complex, or quaternionic Ginibre matrices, or truncated unitary matrices. Additional mixing within one ensemble between matrices and their inverses is also covered. Exact determinantal and Pfaffian expressions are given in terms of the respective kernels of orthogonal polynomials or functions. Here we list all known cases and some straightforward generalisations. The asymptotic results for large matrix size include new microscopic universality classes at the origin and a generalisation of weak non-unitarity close to the unit circle. So far in all other parts of the spectrum the known standard universality classes have been identified. In the limit of infinite products the Lyapunov and stability exponents share the same normal distribution. To leading order they both follow a permanental point processes. Our focus is on presenting recent developments in this rapidly evolving area of research.

Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is known that as the number of matrices in the product tends to infinity, the probability that all eigenvalues are real tends to unity. We quantify the distribution of the number of real eigenvalues for products of finite size real Gaussian matrices by giving an explicit Pfaffian formula for the probability that there are exactly k real eigenvalues as a determinant with entries involving particular Meijer G-functions. We also compute the explicit form of the Pfaffian correlation kernel for the correlation between real eigenvalues, and the correlation between complex eigenvalues. The simplest example of these -the eigenvalue density of the real eigenvalues -gives by integration the expected number of real eigenvalues. Our ability to perform these calculations relies on the construction of certain skew-orthogonal polynomials in the complex plane, the computation of which is carried out using their relationship to particular random matrix averages.