Realistic network growth using only local information: From random to scale-free and beyond

Details Realistic network growth using only local information: From random to scale-free and beyond Realistic network growth using only local information: From random to scale-free and beyond

2006-08-31

arxiv.org/abs/cond-mat/0608733v2

Physics

Condensed Matter

Statistical Mechanics

Minor typos corrected

Scientific paper

We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment probabilities. Scale-free networks arise at the transition point between quasi-random and quasi-ordered networks. We provide a detailed formalism which accurately describes the entire network range, including this critical point. Our formalism is built around a statistical description of the inter-node linkages, as opposed to the single-node degrees, and can be applied to any real-world network -- in particular, those where node-node degree correlations might be important.

Affiliated with

Also associated with

No associations

Rating

Realistic network growth using only local information: From random to scale-free and beyond 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 Realistic network growth using only local information: From random to scale-free and beyond, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Realistic network growth using only local information: From random to scale-free and beyond will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396914