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.
Description
Identifying influential spreaders in complex networks
%0 Generic
%1 Kitsak2010
%A Kitsak, Maksim
%A Gallos, Lazaros K.
%A Havlin, Shlomo
%A Liljeros, Fredrik
%A Muchnik, Lev
%A Stanley, H. Eugene
%A Makse, Hernan A.
%D 2010
%K analysis centrality network social toread
%T Identifying influential spreaders in complex networks
%U http://arxiv.org/abs/1001.5285
%X 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.
@misc{Kitsak2010,
abstract = { 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.
},
added-at = {2010-02-07T19:54:49.000+0100},
author = {Kitsak, Maksim and Gallos, Lazaros K. and Havlin, Shlomo and Liljeros, Fredrik and Muchnik, Lev and Stanley, H. Eugene and Makse, Hernan A.},
biburl = {https://www.bibsonomy.org/bibtex/218a1220e45e38620051a0c9b854d1a28/hotho},
description = {Identifying influential spreaders in complex networks},
interhash = {9545e268e6074cf2edc21693e7bb1b04},
intrahash = {18a1220e45e38620051a0c9b854d1a28},
keywords = {analysis centrality network social toread},
note = {cite arxiv:1001.5285
Comment: 31 pages, 12 figures},
timestamp = {2010-02-07T19:54:49.000+0100},
title = {Identifying influential spreaders in complex networks},
url = {http://arxiv.org/abs/1001.5285},
year = 2010
}