Guan Wang

Guan Wang

Auto-generated profile, based on publicly available information

Guan Wang

School of Information Technology, Ping Dingshan University?Ping Dingshan, China, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
HHHaifeng Hu
Haifeng Hu
ZSZejun Sun
Zejun Sun
FWFeifei Wang
Feifei Wang
LZLiwen Zhang
Liwen Zhang
GWGuan Wang
Guan Wang
In complex networks, key nodes are important factors that directly affect network structure and functions. Therefore, accurate mining and identification of key nodes are crucial to achieving better control and a higher utilization rate of complex networks. To address this problem, this paper proposes an accurate and efficient algorithm for critical node mining. The influential nodes are determined using both global and local information (GLI) to solve the shortcoming of the existing key node identification methods that consider either local or global information. The proposed method considers two main factors, global and local influences. The global influence is determined using the K-shell hierarchical information of a node, and local influence is obtained considering the number of edges connected by the node and the given values of adjacent nodes. The given values of adjacent nodes are determined based on the degree and K-shell hierarchical information. Further, the similarity coefficient of neighbors is considered, which enhances the differentiation degree of the adjacent given values. The proposed method solves the problems of the high complexity of global information-based algorithms and the low accuracy of local information-based algorithms. The proposed method is verified by simulation experiments using the SIR and SI models as a reference, and twelve typical real-world networks are used for the comparison. The proposed GLI algorithm is compared with several common algorithms at different periods. The comparison results show that the GLI algorithm can effectively explore influential nodes in complex networks.

10 May 2023 in Heliyon
Verified
Journal Article
Open access
GWGuan Wang
Guan Wang
SASyazwina Binti Alias
Syazwina Binti Alias
ZSZejun Sun
Zejun Sun
FWFeifei Wang
Feifei Wang
AFAiwan Fan
Aiwan Fan
HHHaifeng Hu
Haifeng Hu
Influential nodes identification technology is one of the important topics which has been widely applied to logistics node location, social information dissemination, transportation network carrying, biological virus dissemination, power network anti-destruction, etc. At present, a large number of influential nodes identification methods have been studied, but the algorithms that are simple to execute, have high accuracy and can be better applied to real networks are still the focus of research. Therefore, due to the advantages of simple to execute in voting mechanism, a novel algorithm based on adaptive adjustment of voting ability (AAVA) to identify the influential nodes is presented by considering the local attributes of node and the voting contribution of its neighbor nodes, to solve the problem of low accuracy and discrimination of the existing algorithms. This proposed algorithm uses the similarity between the voting node and the voted node to dynamically adjust its voting ability without setting any parameters, so that a node can contribute different voting abilities to different neighbor nodes. To verify the performance of AAVA algorithm, the running results of 13 algorithms are analyzed and compared on 10 different networks with the SIR model as a reference. The experimental results show that the influential nodes identified by AAVA have high consistency with SIR model in Top-10 nodes and Kendall correlation, and have better infection effect of the network. Therefore, it is proved that AAV algorithm has high accuracy and effectiveness, and can be applied to real complex networks of different types and sizes.

22 September 2023
Verified
Conference Paper
Open access
GWGuan Wang
Guan Wang
RPRajamohan Parthasarathy
Rajamohan Parthasarathy
YLYuanzhe Li
Yuanzhe Li
Complex networks can explain the relationship between the nodes or the systems in the real world, and their topology determines the influence of nodes in network. Among them, the identification of influence nodes has become an important research content in complex networks because of its influence in different fields. It has played an important role that cannot be ignored in the construction of emergency logistics networks, social network, transportation network, biological virus network and power network. In the real social network, the key figures or important information in the network can effectively control the information transmission in the network and carry out marketing activities. Therefore, aiming at the common problems of existing algorithms, including the inaccurate results of simple methods and the high computational complexity of precise methods combined with actual properties in the network, this paper will deeply study the optimization problems affecting node identification in complex networks based on voting method, and proposed a voting method for key node identification based on multi-attributes (VMM) in social networks, such as degree value, clustering coefficient and number of neighbors of nodes are integrated into the voting process. By comparing the classical algorithms and the voting algorithms under the SIR model, VMM algorithms can effectively identify the key nodes in the social network.