IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1209.2817.html
   My bibliography  Save this paper

Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks

Author

Listed:
  • Boris Podobnik
  • Davor Horvatic
  • Mark Dickison
  • H. Eugene Stanley

Abstract

We 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.

Suggested Citation

  • Boris Podobnik & Davor Horvatic & Mark Dickison & H. Eugene Stanley, 2012. "Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks," Papers 1209.2817, arXiv.org.
    • Handle: RePEc:arx:papers:1209.2817
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1209.2817
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tian, Lixin & Huang, Yi & Dong, Gaogao & Du, Ruijin & Shi, Liu, 2014. "Robustness of interdependent and interconnected clustered networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 412(C), pages 120-126.
    2. Dong, Gaogao & Tian, Lixin & Du, Ruijin & Fu, Min & Stanley, H. Eugene, 2014. "Analysis of percolation behaviors of clustered networks with partial support–dependence relations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 370-378.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1209.2817. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.