We introduce a number of random matrix models describing the Google matrix G of directed networks. The properties of their spectra and eigenstates are analyzed by numerical matrix diagonalization. We show that for certain models it is possible to have an algebraic decay of PageRank vector with the exponent similar to real directed networks. At the same time the spectrum has no spectral gap and ...

A recently introduced extension of the Corner Transfer Matrix Renormalisation Group (CTMRG) method useful for the study of self-avoiding walk type models is presented in detail and applied to a class of interacting self-avoiding walks due to Blöte and Nienhuis. This model displays two different types of collapse transition depending on model parameters. One is the standard θ-point transition. T...

In this paper we present an analytic method for calculating the transition probability between two random Gaussian matrices with given eigenvalue spectra in the context of Dyson Brownian motion. We show that in the Coulomb gas language, in large N limit, memory of the initial state is preserved in the form of a universal linear potential acting on the eigenvalues. We compute the likelihood of a...