2012•RePEc: Research Papers in EconomicsOpen access

Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks

Boris Podobnik, Davor Horvatić, Mark E. Dickison, Harry Eugene Stanley

Open full text 0 citations

Abstract

We generalize the scale-free network model of Barabàsi 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.

Open-access reader

About this research paper

What this paper is about

We generalize the scale-free network model of Barabàsi 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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We generalize the scale-free network model of Barabàsi 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.

Key concepts: Preferential attachment, Interdependent networks, Interdependence, Clustering coefficient, Scale-free network, Complex network, Computer science, The Internet

Related papers

Back to paper searchBrowse research topicsOriginal source
Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks — Research Paper | ScholarLens