Weight-driven growing networks

Details Weight-driven growing networks Weight-driven growing networks

2004-08-12

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

Phys. Rev. E 71, 026103 (2005)

Physics

Condensed Matter

Disordered Systems and Neural Networks

6 pages, 2 eps figures

Scientific paper

10.1103/PhysRevE.71.026103

We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via the simplest weight-driven rule: A newly-added node is connected to an already existing node with the probability which is proportional to the weight of that node. We show that the node weight distribution n(w) has a universal, that is independent on the link weight distribution, tail: n(w) ~ w^-3 as w->oo. Results are particularly neat for the exponential link weight distribution when n(w) is algebraic over the entire weight range.

Affiliated with

Also associated with

No associations

Rating

Weight-driven growing networks 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 Weight-driven growing networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weight-driven growing networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574791