A Critical Candidate Node-Based Attack Model of Network Controllability.

The controllability of complex networks is a core issue in network research. Assessing the controllability robustness of networks under destructive attacks holds significant practical importance. This paper studies the controllability of networks from the perspective of malicious attacks. A novel attack model is proposed to evaluate and challenge network controllability. This method disrupts network controllability with high precision by identifying and targeting critical candidate nodes. The model is compared with traditional attack methods, including degree-based, betweenness-based, closeness-based, pagerank-based, and hierarchical attacks. Results show that the model outperforms these methods in both disruption effectiveness and computational efficiency. Extensive experiments on both synthetic and real-world networks validate the superior performance of this approach. This study provides valuable insights for identifying key nodes crucial for maintaining network controllability. It also offers a solid framework for enhancing network resilience against malicious attacks.