48 Citations (Scopus)

Abstract

Contact processes on complex networks are a recent subject of study in nonequilibrium statistical physics and they are also important to applied fields such as epidemiology and computer and communication networks. A basic issue concerns finding an optimal strategy for spreading. We provide a universal strategy that, when a basic quantity in the contact process dynamics, the contact probability determined by a generic function of its degree W (k), is chosen to be inversely proportional to the node degree, i.e., W (k) ∼ k-1, spreading can be maximized. Computation results on both model and real-world networks verify our theoretical prediction. Our result suggests the determining role played by small-degree nodes in optimizing spreading, in contrast to the intuition that hub nodes are important for spreading dynamics on complex networks.

Original languageEnglish (US)
Article number066109
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume78
Issue number6
DOIs
StatePublished - Dec 1 2008

Fingerprint

Contact Process
Complex Networks
Vertex of a graph
Statistical Physics
Epidemiology
Computer Networks
epidemiology
Optimal Strategy
computer networks
Communication Networks
Non-equilibrium
hubs
communication networks
Directly proportional
Contact
Verify
Prediction
physics
predictions
Model

ASJC Scopus subject areas

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

Cite this

Optimal contact process on complex networks. / Yang, Rui; Zhou, Tao; Xie, Yan Bo; Lai, Ying-Cheng; Wang, Bing Hong.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 78, No. 6, 066109, 01.12.2008.

Research output: Contribution to journalArticle

Yang, Rui ; Zhou, Tao ; Xie, Yan Bo ; Lai, Ying-Cheng ; Wang, Bing Hong. / Optimal contact process on complex networks. In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 2008 ; Vol. 78, No. 6.
@article{cd9da73238c94c998f4459efacf2e7ca,
title = "Optimal contact process on complex networks",
abstract = "Contact processes on complex networks are a recent subject of study in nonequilibrium statistical physics and they are also important to applied fields such as epidemiology and computer and communication networks. A basic issue concerns finding an optimal strategy for spreading. We provide a universal strategy that, when a basic quantity in the contact process dynamics, the contact probability determined by a generic function of its degree W (k), is chosen to be inversely proportional to the node degree, i.e., W (k) ∼ k-1, spreading can be maximized. Computation results on both model and real-world networks verify our theoretical prediction. Our result suggests the determining role played by small-degree nodes in optimizing spreading, in contrast to the intuition that hub nodes are important for spreading dynamics on complex networks.",
author = "Rui Yang and Tao Zhou and Xie, {Yan Bo} and Ying-Cheng Lai and Wang, {Bing Hong}",
year = "2008",
month = "12",
day = "1",
doi = "10.1103/PhysRevE.78.066109",
language = "English (US)",
volume = "78",
journal = "Physical Review E - Statistical, Nonlinear, and Soft Matter Physics",
issn = "1539-3755",
publisher = "American Physical Society",
number = "6",

}

TY - JOUR

T1 - Optimal contact process on complex networks

AU - Yang, Rui

AU - Zhou, Tao

AU - Xie, Yan Bo

AU - Lai, Ying-Cheng

AU - Wang, Bing Hong

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Contact processes on complex networks are a recent subject of study in nonequilibrium statistical physics and they are also important to applied fields such as epidemiology and computer and communication networks. A basic issue concerns finding an optimal strategy for spreading. We provide a universal strategy that, when a basic quantity in the contact process dynamics, the contact probability determined by a generic function of its degree W (k), is chosen to be inversely proportional to the node degree, i.e., W (k) ∼ k-1, spreading can be maximized. Computation results on both model and real-world networks verify our theoretical prediction. Our result suggests the determining role played by small-degree nodes in optimizing spreading, in contrast to the intuition that hub nodes are important for spreading dynamics on complex networks.

AB - Contact processes on complex networks are a recent subject of study in nonequilibrium statistical physics and they are also important to applied fields such as epidemiology and computer and communication networks. A basic issue concerns finding an optimal strategy for spreading. We provide a universal strategy that, when a basic quantity in the contact process dynamics, the contact probability determined by a generic function of its degree W (k), is chosen to be inversely proportional to the node degree, i.e., W (k) ∼ k-1, spreading can be maximized. Computation results on both model and real-world networks verify our theoretical prediction. Our result suggests the determining role played by small-degree nodes in optimizing spreading, in contrast to the intuition that hub nodes are important for spreading dynamics on complex networks.

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

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

U2 - 10.1103/PhysRevE.78.066109

DO - 10.1103/PhysRevE.78.066109

M3 - Article

VL - 78

JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

SN - 1539-3755

IS - 6

M1 - 066109

ER -