Identifying Influential Spreaders of Epidemics on Community Networks

January 28, 2016 Β· Declared Dead Β· πŸ› Journal of Systems Science and Information

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shi-Long Luo, Kai Gong, Li Kang arXiv ID 1601.07700 Category physics.soc-ph Cross-listed cs.SI, stat.ME Citations 25 Venue Journal of Systems Science and Information Last Checked 3 months ago
Abstract
An efficient strategy for the identification of influential spreaders that could be used to control epidemics within populations would be of considerable importance. Generally, populations are characterized by its community structures and by the heterogeneous distributions of weak ties among nodes bridging over communities. A strategy for community networks capable of identifying influential spreaders that accelerate the spread of disease is here proposed. In this strategy, influential spreaders serve as target nodes. This is based on the idea that, in k-shell decomposition, weak ties and strong ties are processed separately. The strategy was used on empirical networks constructed from online social networks, and results indicated that this strategy is more accurate than other strategies. Its effectiveness stems from the patterns of connectivity among neighbors, and it successfully identified the important nodes. In addition, the performance of the strategy remained robust even when there were errors in the structure of the network.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted