{"title":"Identifying and Ranking Influential Spreaders in Complex Networks by Localized Decreasing Gravity Model","authors":"Nan Xiang, Xiao Tang, Huiling Liu, Xiaoxia Ma","doi":"10.1093/comjnl/bxad097","DOIUrl":null,"url":null,"abstract":"Abstract Identifying crucial nodes in complex networks is paid more attention in recent years. Some classical methods, such as degree centrality, betweenness centrality and closeness centrality, have their advantages and disadvantages. Recently, the gravity model is applied to describe the relationship of nodes in a complex network. However, the interaction force in gravity model follows the square law of distance, which is inconsistent with the actual situation. Most people are generally affected by those who are surrounding them, which means that local influence should be emphasized. To address this issue, we propose an indexing method called localized decreasing gravity centrality by maximizing the local influence of a node. In the proposed measure, the mass and radius of gravity model are redefined, which can represent the spreading ability of the node. In addition, a decreasing weight is added to strengthen the local influence of a node. To evaluate the performance of the proposed method, we utilize four different types of networks, including interaction networks, economic networks, collaboration networks and animal social networks. Also, two different infectious disease models, susceptible-infectious-recovered (SIR) and susceptible-exposed-low risk-high risk-recovered (SELHR), are utilized to examine the spreading ability of influential nodes.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":"35 1","pages":"0"},"PeriodicalIF":1.5000,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/comjnl/bxad097","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract Identifying crucial nodes in complex networks is paid more attention in recent years. Some classical methods, such as degree centrality, betweenness centrality and closeness centrality, have their advantages and disadvantages. Recently, the gravity model is applied to describe the relationship of nodes in a complex network. However, the interaction force in gravity model follows the square law of distance, which is inconsistent with the actual situation. Most people are generally affected by those who are surrounding them, which means that local influence should be emphasized. To address this issue, we propose an indexing method called localized decreasing gravity centrality by maximizing the local influence of a node. In the proposed measure, the mass and radius of gravity model are redefined, which can represent the spreading ability of the node. In addition, a decreasing weight is added to strengthen the local influence of a node. To evaluate the performance of the proposed method, we utilize four different types of networks, including interaction networks, economic networks, collaboration networks and animal social networks. Also, two different infectious disease models, susceptible-infectious-recovered (SIR) and susceptible-exposed-low risk-high risk-recovered (SELHR), are utilized to examine the spreading ability of influential nodes.
期刊介绍:
The Computer Journal is one of the longest-established journals serving all branches of the academic computer science community. It is currently published in four sections.