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...

Full description

Bibliographic Details
Main Authors: Yong Liu, Zijun Cheng, Xiaoqin Li, Zongshui Wang
Format: Article
Language:English
Published: Hindawi-Wiley 2023-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2023/6985650
_version_ 1826993208822857728
author Yong Liu
Zijun Cheng
Xiaoqin Li
Zongshui Wang
author_facet Yong Liu
Zijun Cheng
Xiaoqin Li
Zongshui Wang
author_sort Yong Liu
collection DOAJ
description 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.
first_indexed 2024-04-09T13:57:27Z
format Article
id doaj.art-1407f96235144a8bbcedebfc4e7d61a5
institution Directory Open Access Journal
issn 1099-0526
language English
last_indexed 2025-02-18T09:00:30Z
publishDate 2023-01-01
publisher Hindawi-Wiley
record_format Article
series Complexity
spelling doaj.art-1407f96235144a8bbcedebfc4e7d61a52024-11-02T23:52:53ZengHindawi-WileyComplexity1099-05262023-01-01202310.1155/2023/6985650An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex NetworksYong Liu0Zijun Cheng1Xiaoqin Li2Zongshui Wang3School of Artificial IntelligenceSchool of Artificial IntelligenceCollege of Electronic InformationSchool of Economics and ManagementThe 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.http://dx.doi.org/10.1155/2023/6985650
spellingShingle Yong Liu
Zijun Cheng
Xiaoqin Li
Zongshui Wang
An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
Complexity
title An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
title_full An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
title_fullStr An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
title_full_unstemmed An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
title_short An Entropy-Based Gravity Model for Influential Spreaders Identification in Complex Networks
title_sort entropy based gravity model for influential spreaders identification in complex networks
url http://dx.doi.org/10.1155/2023/6985650
work_keys_str_mv AT yongliu anentropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT zijuncheng anentropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT xiaoqinli anentropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT zongshuiwang anentropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT yongliu entropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT zijuncheng entropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT xiaoqinli entropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks
AT zongshuiwang entropybasedgravitymodelforinfluentialspreadersidentificationincomplexnetworks