Optimal contact process on complex networks
- Yang, Rui Department of Electrical Engineering, Arizona State University, Tempe, USA
- Zhou, Tao Department of Modern Physics, University of Science and Technology of China, Hefei, China - Department of Physics, University of Fribourg, Switzerland
- Xie, Yan-Bo Department of Modern Physics, University of Science and Technology of China, Hefei, China
- Lai, Ying-Cheng Department of Electrical Engineering, Arizona State University, Tempe, USA - Department of Physics, Arizona State University, Tempe, USA
- Wang, Bing-Hong Department of Modern Physics, University of Science and Technology of China, Hefei, China
-
18.12.2008
Published in:
- Physical Review E. - 2008, vol. 78, no. 6, p. 066109
English
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⁻¹, 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.
- Faculty
- Faculté des sciences et de médecine
- Department
- Département de Physique
- Language
-
- English
- Classification
- Physics
- License
- License undefined
- Identifiers
-
- RERO DOC 11358
- DOI 10.1103/PhysRevE.78.066109
- Persistent URL
- https://folia.unifr.ch/unifr/documents/301059
Statistics
Document views: 108
File downloads:
- zhou_ocp.pdf: 76