Scaling exponents and clustering coefficients of a growing random network.
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidding self-connection and multiple links of the same direction between any two nodes. Scaling exponents in the range of 1-2 are obtained through Monte Carlo simulations and various clustering coefficients are calculated, one of which, C(out), is of the order of 10(-1), indicating that the network resembles a small world. The out-degree distribution has an exponential cutoff for large out degree.
Zhou
Haijun
H
Max-Planck-Institute of Colloids and Interfaces, Potsdam 14424, Germany.