Chen, Y.; Paul, G.; Havlin, S.; Liljeros, F. & Stanley, H. E.
(2008):
Finding a Better Immunization Strategy.
In: Physical Review Letters,
Ausgabe/Number: 5,
Vol. 101,
Verlag/Publisher: APS.
Erscheinungsjahr/Year: 2008.
Seiten/Pages: 058701.
[Volltext] [BibTeX]
[Endnote]
@article{chen:058701,
author = {Chen, Yiping and Paul, Gerald and Havlin, Shlomo and Liljeros, Fredrik and Stanley, H. Eugene},
title = {Finding a Better Immunization Strategy},
journal = {Physical Review Letters},
publisher = {APS},
year = {2008},
volume = {101},
number = {5},
pages = {058701},
url = {http://link.aps.org/abstract/PRL/v101/e058701},
doi = {10.1103/PhysRevLett.101.058701},
keywords = {graph, clustering, toread}
}
%0 = article
%A = Chen, Yiping and Paul, Gerald and Havlin, Shlomo and Liljeros, Fredrik and Stanley, H. Eugene
%D = 2008
%I = APS
%T = Finding a Better Immunization Strategy
%U = http://link.aps.org/abstract/PRL/v101/e058701
cite arxiv:1001.5285
mment: 31 pages, 12 figures:
Kitsak, M.; Gallos, L. K.; Havlin, S.; Liljeros, F.; Muchnik, L.; Stanley, H. E. & Makse, H. A.
(2010):
Identifying influential spreaders in complex networks.
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
Networks portray a multitude of interactions through which people meet, ideas
e spread, and infectious diseases propagate within a society. Identifying the
st efficient "spreaders" in a network is an important step to optimize the
e of available resources and ensure the more efficient spread of information.
re we show that, in contrast to common belief, the most influential spreaders
a social network do not correspond to the best connected people or to the
st central people (high betweenness centrality). Instead, we find: (i) The
st efficient spreaders are those located within the core of the network as
entified by the k-shell decomposition analysis. (ii) When multiple spreaders
e considered simultaneously, the distance between them becomes the crucial
rameter that determines the extend of the spreading. Furthermore, we find
at- in the case of infections that do not confer immunity on recovered
dividuals- the infection persists in the high k-shell layers of the network
der conditions where hubs may not be able to preserve the infection. Our
alysis provides a plausible route for an optimal design of efficient
ssemination strategies.
@misc{Kitsak2010,
author = {Kitsak, Maksim and Gallos, Lazaros K. and Havlin, Shlomo and Liljeros, Fredrik and Muchnik, Lev and Stanley, H. Eugene and Makse, Hernan A.},
title = {Identifying influential spreaders in complex networks},
year = {2010},
note = {cite arxiv:1001.5285
mment: 31 pages, 12 figures},
url = {http://arxiv.org/abs/1001.5285},
keywords = {centrality, social, analysis, network, toread},
abstract = { Networks portray a multitude of interactions through which people meet, ideas
e spread, and infectious diseases propagate within a society. Identifying the
st efficient "spreaders" in a network is an important step to optimize the
e of available resources and ensure the more efficient spread of information.
re we show that, in contrast to common belief, the most influential spreaders
a social network do not correspond to the best connected people or to the
st central people (high betweenness centrality). Instead, we find: (i) The
st efficient spreaders are those located within the core of the network as
entified by the k-shell decomposition analysis. (ii) When multiple spreaders
e considered simultaneously, the distance between them becomes the crucial
rameter that determines the extend of the spreading. Furthermore, we find
at-- in the case of infections that do not confer immunity on recovered
dividuals-- the infection persists in the high k-shell layers of the network
der conditions where hubs may not be able to preserve the infection. Our
alysis provides a plausible route for an optimal design of efficient
ssemination strategies.
}
}
%0 = misc
%A = Kitsak, Maksim and Gallos, Lazaros K. and Havlin, Shlomo and Liljeros, Fredrik and Muchnik, Lev and Stanley, H. Eugene and Makse, Hernan A.
%D = 2010
%T = Identifying influential spreaders in complex networks
%U = http://arxiv.org/abs/1001.5285