paper

Growing Random Networks with Fitness

arXiv:cond-mat/0103423 · doi:10.1016/S0378-4371(01)00408-3

Abstract

Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes of connectivity and random additive fitness , with rate . For we find the connectivity distribution is power law with exponent . In the second model (B), the network is built by connecting nodes to nodes of connectivity , random additive fitness and random multiplicative fitness with rate . This model also has a power law connectivity distribution, but with an exponent which depends on the multiplicative fitness at each node. In the third model (C), a directed graph is considered and is built by the addition of nodes and the creation of links. A node with fitness , incoming links and outgoing links gains a new incoming link with rate , and a new outgoing link with rate . The distributions of the number of incoming and outgoing links both scale as power laws, with inverse logarithmic corrections.

6 pages and 1 figure, submitted to publication

References in corpus (2)

Cited by in corpus (30)