A random interacting network model for complex networks

Bedartha Goswami*, Snehal M. Shekatkar, Aljoscha Rheinwalt, G. Ambika, Juergen Kurths

*Corresponding author for this work

Research output: Contribution to journalArticle

1 Citation (Scopus)
6 Downloads (Pure)

Abstract

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.

Original languageEnglish
Article number18183
Number of pages10
JournalScientific Reports
Volume5
Early online date11 Dec 2015
DOIs
Publication statusPublished - 11 Dec 2015

Keywords

  • community structure
  • brain networks
  • transition
  • emergence
  • dynamics

Cite this

Goswami, B., Shekatkar, S. M., Rheinwalt, A., Ambika, G., & Kurths, J. (2015). A random interacting network model for complex networks. Scientific Reports, 5, [18183]. https://doi.org/10.1038/srep18183

A random interacting network model for complex networks. / Goswami, Bedartha; Shekatkar, Snehal M.; Rheinwalt, Aljoscha; Ambika, G.; Kurths, Juergen.

In: Scientific Reports, Vol. 5, 18183, 11.12.2015.

Research output: Contribution to journalArticle

Goswami, B, Shekatkar, SM, Rheinwalt, A, Ambika, G & Kurths, J 2015, 'A random interacting network model for complex networks', Scientific Reports, vol. 5, 18183. https://doi.org/10.1038/srep18183
Goswami B, Shekatkar SM, Rheinwalt A, Ambika G, Kurths J. A random interacting network model for complex networks. Scientific Reports. 2015 Dec 11;5. 18183. https://doi.org/10.1038/srep18183
Goswami, Bedartha ; Shekatkar, Snehal M. ; Rheinwalt, Aljoscha ; Ambika, G. ; Kurths, Juergen. / A random interacting network model for complex networks. In: Scientific Reports. 2015 ; Vol. 5.
@article{749c5f048be24218ade7377018c4de38,
title = "A random interacting network model for complex networks",
abstract = "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.",
keywords = "community structure, brain networks, transition, emergence, dynamics",
author = "Bedartha Goswami and Shekatkar, {Snehal M.} and Aljoscha Rheinwalt and G. Ambika and Juergen Kurths",
note = "This paper was developed within the scope of the DAAD-DST PPP-Indien project 55516784 (INT/FRG/DAAD/P-215) which funded exchange visits between the two participating institutes. B.G. was supported by the IRTG 1740/TRP 2011/50151-0, funded by the DFG/FAPESP. J.K. acknowledges financial support from the Government of the Russian Federation (Agreement No. 14.Z50.31.0033). S.M.S. would like to thank University Grants Comission, New Delhi for the financial assistance as an SRF. B.G. and A.R. thank Niklas Boers for stimulating discussions and comments.",
year = "2015",
month = "12",
day = "11",
doi = "10.1038/srep18183",
language = "English",
volume = "5",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",

}

TY - JOUR

T1 - A random interacting network model for complex networks

AU - Goswami, Bedartha

AU - Shekatkar, Snehal M.

AU - Rheinwalt, Aljoscha

AU - Ambika, G.

AU - Kurths, Juergen

N1 - This paper was developed within the scope of the DAAD-DST PPP-Indien project 55516784 (INT/FRG/DAAD/P-215) which funded exchange visits between the two participating institutes. B.G. was supported by the IRTG 1740/TRP 2011/50151-0, funded by the DFG/FAPESP. J.K. acknowledges financial support from the Government of the Russian Federation (Agreement No. 14.Z50.31.0033). S.M.S. would like to thank University Grants Comission, New Delhi for the financial assistance as an SRF. B.G. and A.R. thank Niklas Boers for stimulating discussions and comments.

PY - 2015/12/11

Y1 - 2015/12/11

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.

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

KW - community structure

KW - brain networks

KW - transition

KW - emergence

KW - dynamics

U2 - 10.1038/srep18183

DO - 10.1038/srep18183

M3 - Article

VL - 5

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

M1 - 18183

ER -