Statistics of Weighted Networks

Preprint

10 December 2004

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0408295

Abstract

We study the statistics of growing networks in which each link carries a weight (k_i k_j)^theta, where k_i and k_j are the node degrees at the endpoints of link ij. Network growth is governed by preferential attachment in which a newly-added node attaches to a node of degree k with rate A_k=k+lambda. For general values of theta and lambda, we compute the total weight of a network as a function of the number of nodes N and the distribution of link weights. Generically, the total weight grows as N for lambda>theta-1, and super-linearly otherwise. The link weight distribution is predicted to have a power law form that is modified by a logarithmic correction for the case lambda=0. We also determine the node strength, defined as the sum of the weights of the links that attach to the node, as function of k. Using known results for degree correlations, we deduce the scaling of the node strength on k and N.

Keywords

All Related Versions

Version 1, 2004-08-12, ArXiv
Version 2, 2004-12-10, ArXiv
Published version: Physical Review E, 71 (3), 036124.

This publication has 0 references indexed in Scilit: