Preferential Attachment in the Interaction between Dynamically Generated Interdependent Networks
Boris Podobnik, Davor Horvatic, Mark Dickison, H. Eugene Stanley

TL;DR
This paper extends the Barabási-Albert model to interdependent networks with preferential attachment, providing analytical solutions and illustrating applications in Internet and finance networks.
Contribution
It introduces a stochastic model for scale-free interdependent networks with preferential attachment, analyzing their degree distribution and clustering properties.
Findings
Power-law degree distributions derived analytically.
Cross-clustering coefficient follows a power law with network size.
Model applications demonstrated in Internet and finance networks.
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 follows a power law. We illustrate the models using selected examples from the Internet and finance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Graph theory and applications
