Organization of complex networks without multiple connections

We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices. The number of vertices in this core varies in the range between $const N^{1/2}$ and $const N^{2/3}$, where $N$ is the number of vertices in a network. At the birth point of the core, we obtain the size-dependent cut-off of the distribution of the number of connections and find that its position differs from earlier estimates.Comment: 5 pages, 2 figure

Exact solution and asymptotic behaviour of the asymmetric simple exclusion process on a ring

In this paper, we study an exact solution of the asymmetric simple exclusion process on a periodic lattice of finite sites with two typical updates, i.e., random and parallel. Then, we find that the explicit formulas for the partition function and the average velocity are expressed by the Gauss hypergeometric function. In order to obtain these results, we effectively exploit the recursion formula for the partition function for the zero-range process. The zero-range process corresponds to the asymmetric simple exclusion process if one chooses the relevant hop rates of particles, and the recursion gives the partition function, in principle, for any finite system size. Moreover, we reveal the asymptotic behaviour of the average velocity in the thermodynamic limit, expanding the formula as a series in system size.Comment: 10 page