Competition among networks highlights the power of the weak

Nat Commun. 2016 Nov 14:7:13273. doi: 10.1038/ncomms13273.

Abstract

The unpreventable connections between real networked systems have recently called for an examination of percolation, diffusion or synchronization phenomena in multilayer networks. Here we use network science and game theory to explore interactions in networks-of-networks and model these as a game for gaining importance. We propose a viewpoint where networks choose the connection strategies, in contrast with classical approaches where nodes are the active players. Specifically, we investigate how creating paths between networks leads to different Nash equilibria that determine their structural and dynamical properties. In a wide variety of cases, selecting adequate connections leads to a cooperative solution that allows weak networks to overcome the strongest opponent. Counterintuitively, each weak network can induce a global transition to such cooperative configuration regardless of the actions of the strongest network. This power of the weak reveals a critical dominance of the underdogs in the fate of networks-of-networks.

Publication types

  • Research Support, N.I.H., Intramural

MeSH terms

  • Algorithms*
  • Computer Communication Networks
  • Game Theory*
  • Humans
  • Models, Theoretical*
  • Neural Networks, Computer*