{"title":"基于熵的复杂网络影响传播者识别重力模型","authors":"Yong Liu, Zijun Cheng, Xiaoqin Li, Zongshui Wang","doi":"10.1155/2023/6985650","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The mining of key nodes is an important topic in complex network research, which can help identify influencers. The study is necessary for blocking the spread of epidemics, controlling public opinion, and managing transportation. The techniques thus far suggested have a lot of drawbacks; they either depend on the regional distribution of nodes or the global character of the network. The gravity formula based on node information is a good mathematical model that can represent the magnitude of attraction between nodes. However, the gravity model requires less node information and has limitations. In this study, we propose a gravity model based on Shannon entropy to effectively address the aforementioned issues. The spreading probability method is employed to enhance the model’s functionality and applicability. Through testing, it has been determined that the suggested model is a good alternative to the gravity model for selecting influential nodes.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2023 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/6985650","citationCount":"0","resultStr":"{\"title\":\"An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks\",\"authors\":\"Yong Liu, Zijun Cheng, Xiaoqin Li, Zongshui Wang\",\"doi\":\"10.1155/2023/6985650\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>The mining of key nodes is an important topic in complex network research, which can help identify influencers. The study is necessary for blocking the spread of epidemics, controlling public opinion, and managing transportation. The techniques thus far suggested have a lot of drawbacks; they either depend on the regional distribution of nodes or the global character of the network. The gravity formula based on node information is a good mathematical model that can represent the magnitude of attraction between nodes. However, the gravity model requires less node information and has limitations. In this study, we propose a gravity model based on Shannon entropy to effectively address the aforementioned issues. The spreading probability method is employed to enhance the model’s functionality and applicability. Through testing, it has been determined that the suggested model is a good alternative to the gravity model for selecting influential nodes.</p>\\n </div>\",\"PeriodicalId\":50653,\"journal\":{\"name\":\"Complexity\",\"volume\":\"2023 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2023-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/6985650\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/2023/6985650\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2023/6985650","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
The mining of key nodes is an important topic in complex network research, which can help identify influencers. The study is necessary for blocking the spread of epidemics, controlling public opinion, and managing transportation. The techniques thus far suggested have a lot of drawbacks; they either depend on the regional distribution of nodes or the global character of the network. The gravity formula based on node information is a good mathematical model that can represent the magnitude of attraction between nodes. However, the gravity model requires less node information and has limitations. In this study, we propose a gravity model based on Shannon entropy to effectively address the aforementioned issues. The spreading probability method is employed to enhance the model’s functionality and applicability. Through testing, it has been determined that the suggested model is a good alternative to the gravity model for selecting influential nodes.
期刊介绍:
Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.