We consider the product of n complex non-Hermitian, independent random matrices, each of size N × N with independent identically distributed Gaussian entries (Ginibre matrices). The joint probability distribution of the complex eigenvalues of the product matrix is found to be given by a determinantal point process as in the case of a single Ginibre matrix, but with a more complicated weight given by a Meijer G-function depending on n. Using the method of orthogonal polynomials we compute all eigenvalue density correlation functions exactly for finite N and fixed n. They are given by the determinant of the corresponding kernel which we construct explicitly. In the large-N limit at fixed n we first determine the microscopic correlation functions in the bulk and at the edge of the spectrum. After unfolding they are identical to that of the Ginibre ensemble with n = 1 and thus universal. In contrast the microscopic correlations we find at the origin differ for each n > 1 and generalise the known Bessel-law in the complex plane for n = 2 to a new hypergeometric kernel 0 F n−1 .

We analyse the properties of a very simple "balls-in-boxes" model which can exhibit a phase transition between a fluid and a condensed phase, similar to behaviour encountered in models of random geometries in one, two and four dimensions. This model can be viewed as a generalisation of the backgammon model introduced by Ritort as an example of glassy behaviour without disorder.

We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk localizes in the largest nearly spherical region of the lattice which is free of defects. This localization phenomenon, which is purely classical in nature, is explained in terms of the Lifshitz states of a certain random operator.

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is characterized by two global parameters, the fractal and the spectral dimensions, which are explicitly calculated. It is discussed in detail how the geometry of the graphs varies when the weights of the nodes are modified. The stability of the scale-free regime is also considered: when it breaks down, either a scale is spontaneously generated or else, a "singular" node appears and the graphs become crumpled. A new computer algorithm to generate these random graphs is proposed. Possible generalizations are also discussed. In particular, more general ensembles are defined along the same lines and the computer algorithm is extended to arbitrary (degenerate) scale-free random graphs.

We show that the eigenvalue density of a product X = X1X2 · · · XM of M independent N × N Gaussian random matrices in the limit N → ∞ is rotationally symmetric in the complex plane and is given by a simple expression ρ(z,z) =M for |z| ≤ σ, and is zero for |z| > σ. The parameter σ corresponds to the radius of the circular support and is related to the amplitude of the Gaussian fluctuations. This form of the eigenvalue density is highly universal. It is identical for products of Gaussian Hermitian, non-Hermitian, real or complex random matrices. It does not change even if the matrices in the product are taken from different Gaussian ensembles. We present a self-contained derivation of this result using a planar diagrammatic technique. Additionally, we conjecture that this distribution also holds for any matrices whose elements are independent, centered random variables with a finite variance or even more generally for matrices which fulfill Pastur-Lindeberg's condition. We provide a numerical evidence supporting this conjecture.