Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2010 : influential_spreaders
Identification of influential spreaders in complex networks
L. Gallos, S. Havlin, M. Kitsak, F. Liljeros, H. Makse, L. Muchnik, and H. Stanley, "Identification of influential spreaders in complex networks", Nature Physics, vol. 6, no. 11, pp. 888--893, Aug 2010.
|   View full paper:    PDF    arXiv    DOI    Press Coverage    Related Presentation    |  Citation:    BibTeX   |

Identification of influential spreaders in complex networks

Lazaros Gallos6, 10
Shlomo Havlin3, 7
Maksim Kitsak1, 2, 8
Fredrik Liljeros4
Hernán Makse6, 9
Lev Muchnik5
H. Eugene Stanley2, 8
1

CAIDA, San Diego Supercomputer Center, University of California San Diego

2

Center for Polymer Studies, Boston University

3

Department of Physics, Bar-Ilan University

4

Department of Sociology, Stockholm University

5

Information Operations and Management Sciences
Stern School of Business

6

Levich Institute

7

Minerva Center

8

Physics Department, Boston University

9

Physics Department, City College of New York

10

Physics Department, University of Thessaloniki

Networks portray a multitude of interactions through which people meet, ideas are spread, and infectious diseases propagate within a society. Identifying the most efficient "spreaders" in a network is an important step to optimize the use of available resources and ensure the more efficient spread of information. Here we show that, in contrast to common belief, the most influential spreaders in a social network do not correspond to the best connected people or to the most central people (high betweenness centrality). Instead, we find: (i) The most efficient spreaders are those located within the core of the network as identified by the k-shell decomposition analysis. (ii) When multiple spreaders are considered simultaneously, the distance between them becomes the crucial parameter that determines the extend of the spreading. Furthermore, we find that-- in the case of infections that do not confer immunity on recovered individuals-- the infection persists in the high k-shell layers of the network under conditions where hubs may not be able to preserve the infection. Our analysis provides a plausible route for an optimal design of efficient dissemination strategies.

Keywords: routing, topology
  Last Modified: Wed Oct-11-2017 17:03:57 PDT
  Page URL: http://www.caida.org/publications/papers/2010/influential_spreaders/index.xml