A graph-neural-network-entropy model of vital node identification on network attack and propagation
Abstract Vital nodes usually play a key role in complex networks. Uncovering these nodes is an important task in protecting the network, especially when the network suffers intentional attacks. Many existing methods have not fully integrated the node features, interactions and states. In this article, we propose a novel method (GNNE) based on graph neural networks and information entropy. The method employs a graph convolutional network (GCN) to learn the nodes’ features, which are input into a graph attention network (GAT) to obtain the influence factor of nodes, and the node influence factors are used to calculate the nodes’ entropy to evaluate the node importance. The GNNE takes advantage of the GCN and GAT, with the GCN well extracting the nodes’ features and the GAT aggregating the features of the nodes’ neighbors by using the attention mechanism to assign different weights to the neighbors with different importance, and the nodes’ entropy quantifies the nodes’ state in the network. The proposed method is trained on a synthetic Barabási–Albert network and tested on six real datasets. Compared with eight traditional topology-based methods and four graph-machine-learning-based methods, the GNNE shows an advantage for vital node identification from the perspectives of network attack and propagation.
Authors
- Huadong Liao (ORCID: https://orcid.org/0000-0002-3401-3032)
- Tian Qiu (ORCID: https://orcid.org/0000-0001-8510-894X)
- Guang Chen (ORCID: https://orcid.org/0000-0003-2048-7699)
Institutions
- Nanchang Hangkong University (CN)
Publication Details
- Journal
- Journal of Statistical Mechanics Theory and Experiment
- Published
- 2025-10-01
- DOI
- https://doi.org/10.1088/1742-5468/ae068f
- Citations
- 1
- Primary Topic
- Complex Network Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.32