Xiao Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xiao Zhang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Asoke Kumar Nandi
Brunel University of London
1 shared publication - Carlos Artemio Coello Coello
Cinvestav-IPN
1 shared publication - Jianqiang Li
Shenzhen University
1 shared publication - Lijia Ma
College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China
1 shared publication - Maoguo Gong
Xidian University, Xi'an, China
1 shared publication - Qiuzhen Lin
Shenzhen University
1 shared publication
Latest Publications
- 26 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (6) , 3808-3821
Enhancing Robustness and Resilience of Multiplex Networks Against Node-Community Cascading Failures
Many real systems are represented in form of multiplex networks composed of a set of nodes, multiple layers of links, and coupling node relationships across all layers. These systems are very vulnerable to damages during both attacks and recoveries due to potential node cascading failures (NCFs). Although some progress has recently been made in studying network robustness and resilience, the comprehensive impacts of coupling node relationships and community structures on NCFs remain unclear. Accordingly, in this article, we study the robustness and resilience of multiplex networks in the presence of NCFs caused by coupling node relationships and community structures. We first model the failure processes of multiplex networks during both attacks and recoveries as node-community cascading failures (called NCCFs), and then theoretically demonstrate the fragility of multiplex networks to random node damages under NCCFs. Subsequently, to improve network robustness and resilience, we adopt a node protection strategy and propose a cost-aware constrained optimization problem. Finally, we devise a degree-based simulated annealing algorithm for solving this optimization problem. Extensive experiments on both simulated and real multiplex networks show that NCCFs make networks more vulnerable to unpredictable damage than classical NCFs. The results also show the superiority of the proposed algorithm over the state-of-the-art algorithms in improving network robustness and resilience.
- 26 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 52 (6) , 3808-3821
Enhancing Robustness and Resilience of Multiplex Networks Against Node-Community Cascading Failures
Many real systems are represented in form of multiplex networks composed of a set of nodes, multiple layers of links, and coupling node relationships across all layers. These systems are very vulnerable to damages during both attacks and recoveries due to potential node cascading failures (NCFs). Although some progress has recently been made in studying network robustness and resilience, the comprehensive impacts of coupling node relationships and community structures on NCFs remain unclear. Accordingly, in this article, we study the robustness and resilience of multiplex networks in the presence of NCFs caused by coupling node relationships and community structures. We first model the failure processes of multiplex networks during both attacks and recoveries as node-community cascading failures (called NCCFs), and then theoretically demonstrate the fragility of multiplex networks to random node damages under NCCFs. Subsequently, to improve network robustness and resilience, we adopt a node protection strategy and propose a cost-aware constrained optimization problem. Finally, we devise a degree-based simulated annealing algorithm for solving this optimization problem. Extensive experiments on both simulated and real multiplex networks show that NCCFs make networks more vulnerable to unpredictable damage than classical NCFs. The results also show the superiority of the proposed algorithm over the state-of-the-art algorithms in improving network robustness and resilience.