Guan Wang
Guan Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Zejun Sun
School of Information Engineering, PingDingShan University, PingDingShan, China
2 shared publications Aiwan Fan
School of Information Engineering, Pingdingshan University, Pingdingshan, Henan, China
1 shared publicationFeifei Wang
School of Information Engineering, Pingdingshan University, Pingdingshan, Henan, China
1 shared publication- Feifei Wang
Renmin University of China
1 shared publication Haifeng Hu
School of Information Engineering, Pingdingshan University, Pingdingshan, Henan, China
1 shared publication- Haifeng Hu
Sun Yat-Sen University, Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 22 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 394-399
Key node identification voting method based on multi-attributes in social complex networks
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.
- 22 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 394-399
Open AccessKey node identification voting method based on multi-attributes in social complex networks
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.
- Open Access
- 29 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-16
Exploring influential nodes using global and local information
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.
- 29 December 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-16
Open AccessExploring influential nodes using global and local information
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.