Weight-driven growing networks
Authors:
- P. L. KrapivskyPKP. L. Krapivsky
- 8 February 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 71 (2) , 026103
Abstract
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 tail, that is, it is independent of the link weight distribution: n (w) approximately w(-3) as w-->infinity . Results are particularly neat for the exponential link weight distribution when n (w) is algebraic over the entire weight range.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- The architecture of complex weighted networksProceedings of the National Academy of Sciences, 2004
- Evolution and Structure of the Internet2004
- Evolution of Networks2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Evolution of the social network of scientific collaborationsPhysica A: Statistical Mechanics and its Applications, 2002
- A stochastic model for the evolution of the WebComputer Networks, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- Scientific collaboration networks. I. Network construction and fundamental resultsPhysical Review E, 2001
- Anomalous voltage distribution of random resistor networks and a new model for the backbone at the percolation thresholdPhysical Review B, 1985