Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks
AbstractWe generalize the scale-free network model of Barab\`asi and Albert [Science 286, 509 (1999)] by proposing a class of stochastic models for scale-free interdependent networks in which interdependent nodes are not randomly connected but rather are connected via preferential attachment (PA). Each network grows through the continuous addition of new nodes, and new nodes in each network attach preferentially and simultaneously to (a) well-connected nodes within the same network and (b) well-connected nodes in other networks. We present analytic solutions for the power-law exponents as functions of the number of links both between networks and within networks. We show that a cross-clustering coefficient vs. size of network $N$ follows a power law. We illustrate the models using selected examples from the Internet and finance.
Download InfoIf 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.
Bibliographic InfoPaper provided by arXiv.org in its series Papers with number 1209.2817.
Date of creation: Sep 2012
Date of revision:
Contact details of provider:
Web page: http://arxiv.org/
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-09-22 (All new papers)
- NEP-ICT-2012-09-22 (Information & Communication Technologies)
- NEP-MIC-2012-09-22 (Microeconomics)
- NEP-NET-2012-09-22 (Network Economics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If references are entirely missing, you can add them using this form.