Scaling exponents and clustering coefficients of a growing random network

Details Scaling exponents and clustering coefficients of a growing random network Scaling exponents and clustering coefficients of a growing random network

2003-03-26

arxiv.org/abs/cond-mat/0303547v1

Physical Review E 66, 016125 (2002)

Physics

Condensed Matter

Statistical Mechanics

six pages, including 5 figures, RevTex 4 format

Scientific paper

10.1103/PhysRevE.66.016125

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 forbidden of 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_{\rm out}$, is of order $10^{-1}$, indicating the network resembles a small-world. The out-degree distribution has an exponential cut-off for large out-degree.

Affiliated with

Also associated with

No associations

Rating

Scaling exponents and clustering coefficients of a growing random network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling exponents and clustering coefficients of a growing random network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling exponents and clustering coefficients of a growing random network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-75511