Multiplexity-facilitated cascades in networks

Charles D. Brummitt, Kyu Min Lee, Kwang-Il Goh

Research output: Contribution to journalArticle

122 Citations (Scopus)

Abstract

Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model to multiplex networks, in which a node activates if a sufficiently large fraction of neighbors in any layer are active. We show that both combining layers (i.e., realizing other interactions play a role) and splitting a network into layers (i.e., recognizing distinct kinds of interactions) facilitate cascades. Notably, layers unsusceptible to global cascades can cooperatively achieve them if coupled. On one hand, this suggests fundamental limitations on predicting cascades without full knowledge of a system's multiplexity; on the other hand, it offers feasible means to control cascades by introducing or removing sparse layers in an existing network.

Original languageEnglish
Article number045102
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume85
Issue number4
DOIs
Publication statusPublished - 2012 Apr 27

Fingerprint

Cascade
cascades
cascade control
Cascade Control
Interaction
interactions
Distinct
Generalise
thresholds
Graph in graph theory
Vertex of a graph
Modeling

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability

Cite this

Multiplexity-facilitated cascades in networks. / Brummitt, Charles D.; Lee, Kyu Min; Goh, Kwang-Il.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 85, No. 4, 045102, 27.04.2012.

Research output: Contribution to journalArticle

@article{7875a0a5f47f478696bb908b2c3f7126,
title = "Multiplexity-facilitated cascades in networks",
abstract = "Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model to multiplex networks, in which a node activates if a sufficiently large fraction of neighbors in any layer are active. We show that both combining layers (i.e., realizing other interactions play a role) and splitting a network into layers (i.e., recognizing distinct kinds of interactions) facilitate cascades. Notably, layers unsusceptible to global cascades can cooperatively achieve them if coupled. On one hand, this suggests fundamental limitations on predicting cascades without full knowledge of a system's multiplexity; on the other hand, it offers feasible means to control cascades by introducing or removing sparse layers in an existing network.",
author = "Brummitt, {Charles D.} and Lee, {Kyu Min} and Kwang-Il Goh",
year = "2012",
month = "4",
day = "27",
doi = "10.1103/PhysRevE.85.045102",
language = "English",
volume = "85",
journal = "Physical Review E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "4",

}

TY - JOUR

T1 - Multiplexity-facilitated cascades in networks

AU - Brummitt, Charles D.

AU - Lee, Kyu Min

AU - Goh, Kwang-Il

PY - 2012/4/27

Y1 - 2012/4/27

N2 - Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model to multiplex networks, in which a node activates if a sufficiently large fraction of neighbors in any layer are active. We show that both combining layers (i.e., realizing other interactions play a role) and splitting a network into layers (i.e., recognizing distinct kinds of interactions) facilitate cascades. Notably, layers unsusceptible to global cascades can cooperatively achieve them if coupled. On one hand, this suggests fundamental limitations on predicting cascades without full knowledge of a system's multiplexity; on the other hand, it offers feasible means to control cascades by introducing or removing sparse layers in an existing network.

AB - Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model to multiplex networks, in which a node activates if a sufficiently large fraction of neighbors in any layer are active. We show that both combining layers (i.e., realizing other interactions play a role) and splitting a network into layers (i.e., recognizing distinct kinds of interactions) facilitate cascades. Notably, layers unsusceptible to global cascades can cooperatively achieve them if coupled. On one hand, this suggests fundamental limitations on predicting cascades without full knowledge of a system's multiplexity; on the other hand, it offers feasible means to control cascades by introducing or removing sparse layers in an existing network.

UR - http://www.scopus.com/inward/record.url?scp=84860608583&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860608583&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.85.045102

DO - 10.1103/PhysRevE.85.045102

M3 - Article

VL - 85

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 4

M1 - 045102

ER -