Growing random networks with fitness
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 k and random additive fitness η, with rate (k−1)+η. For η>0 we find the connectivity distribution is power law with exponent γ=〈η〉+2. In the second model (B), the network is built by connecting nodes to nodes of connectivity k, random additive fitness η and random multiplicative fitness ζ with rate ζ(k−1)+η. 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 (α,β), i incoming links and j outgoing links gains a new incoming link with rate α(i+1), and a new outgoing link with rate β(j+1). The distributions of the number of incoming and outgoing links both scale as power laws, with inverse logarithmic corrections.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 303 (2002)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/|