کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7376150 | 1480077 | 2018 | 28 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
BridgeRank: A novel fast centrality measure based on local structure of the network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: BridgeRank: A novel fast centrality measure based on local structure of the network BridgeRank: A novel fast centrality measure based on local structure of the network](/preview/png/7376150.png)
چکیده انگلیسی
Ranking nodes in complex networks have become an important task in many application domains. In a complex network, influential nodes are those that have the most spreading ability. Thus, identifying influential nodes based on their spreading ability is a fundamental task in different applications such as viral marketing. One of the most important centrality measures to ranking nodes is closeness centrality which is efficient but suffers from high computational complexity O(n3). This paper tries to improve closeness centrality by utilizing the local structure of nodes and presents a new ranking algorithm, called BridgeRank centrality. The proposed method computes local centrality value for each node. For this purpose, at first, communities are detected and the relationship between communities is completely ignored. Then, by applying a centrality in each community, only one best critical node from each community is extracted. Finally, the nodes are ranked based on computing the sum of the shortest path length of nodes to obtained critical nodes. We have also modified the proposed method by weighting the original BridgeRank and selecting several nodes from each community based on the density of that community. Our method can find the best nodes with high spread ability and low time complexity, which make it applicable to large-scale networks. To evaluate the performance of the proposed method, we use the SIR diffusion model. Finally, experiments on real and artificial networks show that our method is able to identify influential nodes so efficiently, and achieves better performance compared to other recent methods.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 496, 15 April 2018, Pages 635-653
Journal: Physica A: Statistical Mechanics and its Applications - Volume 496, 15 April 2018, Pages 635-653
نویسندگان
Chiman Salavati, Alireza Abdollahpouri, Zhaleh Manbari,