TY - JOUR A1 - Goswami, Bedartha A1 - Shekatkar, Snehal M. A1 - Rheinwalt, Aljoscha A1 - Ambika, G. A1 - Kurths, Jürgen T1 - A random interacting network model for complex networks T2 - Scientific reports N2 - We propose a RAndom Interacting Network (RAIN) model to study the interactions between a pair of complex networks. The model involves two major steps: (i) the selection of a pair of nodes, one from each network, based on intra-network node-based characteristics, and (ii) the placement of a link between selected nodes based on the similarity of their relative importance in their respective networks. Node selection is based on a selection fitness function and node linkage is based on a linkage probability defined on the linkage scores of nodes. The model allows us to relate within-network characteristics to between-network structure. We apply the model to the interaction between the USA and Schengen airline transportation networks (ATNs). Our results indicate that two mechanisms: degree-based preferential node selection and degree-assortative link placement are necessary to replicate the observed inter-network degree distributions as well as the observed inter-network assortativity. The RAIN model offers the possibility to test multiple hypotheses regarding the mechanisms underlying network interactions. It can also incorporate complex interaction topologies. Furthermore, the framework of the RAIN model is general and can be potentially adapted to various real-world complex systems. Y1 - 2015 UR - https://publishup.uni-potsdam.de/frontdoor/index/index/docId/38375 SN - 2045-2322 VL - 5 PB - Nature Publ. Group CY - London ER -