کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7377234 | 1480112 | 2016 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Effective identification of multiple influential spreaders by DegreePunishment
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
With the rapid development of social networks, how to effectively identify a small group of nodes to maximize their spreading influence becomes a crucial topic. Traditional centrality-based methods are often very simple but not so effective compared to other complex methods. In this paper, we propose a heuristic method to select spreaders sequentially by carrying out a punishing strategy to the neighbors of those already selected spreaders. We use the Susceptible-Infected-Recovered (SIR) model to evaluate the performance by considering the number of infected nodes in the end. Experiments on four real networks show that our method outperforms traditional centrality-based methods and several heuristic ones.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 461, 1 November 2016, Pages 238-247
Journal: Physica A: Statistical Mechanics and its Applications - Volume 461, 1 November 2016, Pages 238-247
نویسندگان
Xiaojie Wang, Yanyuan Su, Chengli Zhao, Dongyun Yi,