Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Identifying a set of influential spreaders in complex networks
by
Chen, Duan-Bing
, Zhang, Jian-Xiong
, Dong, Qiang
, Zhao, Zhi-Dan
in
639/705/258
/ 639/766/530/2801
/ Algorithms
/ Heuristic
/ Humanities and Social Sciences
/ Methods
/ multidisciplinary
/ Propagation
/ Science
2016
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Identifying a set of influential spreaders in complex networks
by
Chen, Duan-Bing
, Zhang, Jian-Xiong
, Dong, Qiang
, Zhao, Zhi-Dan
in
639/705/258
/ 639/766/530/2801
/ Algorithms
/ Heuristic
/ Humanities and Social Sciences
/ Methods
/ multidisciplinary
/ Propagation
/ Science
2016
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Identifying a set of influential spreaders in complex networks
Journal Article
Identifying a set of influential spreaders in complex networks
2016
Request Book From Autostore
and Choose the Collection Method
Overview
Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-
r
ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and
k
-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency.
Publisher
Nature Publishing Group UK,Nature Publishing Group
Subject
This website uses cookies to ensure you get the best experience on our website.