Projects per year
Network controllability robustness reflects how well a networked system can maintain its controllability against destructive attacks. Its performance can be measured by a sequence of values that record the remaining controllability of the network after a sequential node-removal or edge-removal attacks. In this paper, a hybrid approximation (HyA) method is proposed to estimate the controllability robustness performance of large-scale directed random-graph (RG) networks under random edge-removal attacks. HyA sufficiently utilizes the similarity between the generation mechanism of the RG networks and the destructing process of random edge-removal attacks. Two threshold values are set to classify general RG networks as ‘dense’, ‘sparse’, or ‘median’, according to the average degree of each network. A two-phase approximation is applied to ‘sparse’ RG networks, while different three-phase approximations are applied to ‘dense’ and ‘median’ RG networks, respectively. Simulation results verify that 1) HyA is able to precisely approximate the controllability curves of RG networks under random edge-removal attacks; 2) HyA is time-efficient as compared to the conventional time-consuming attack simulations.
|Number of pages||13|
|Journal||International Journal of Control, Automation and Systems|
|Early online date||30 Jan 2023|
|Publication status||Published - 1 Feb 2023|
Bibliographical noteFunding Information:
This research was supported in part by the National Natural Science Foundation of China (No. 62002249, 61873167), in part by the Foundation of Key Laboratory of System Control and Information Processing, Ministry of Education, P. R. China (No. Scip202103), in part by the Lam Woo Research Fund at Lingnan University (No. LWP20012), and in part by the Hong Kong Research Grants Council under the GRF Grant CityU11206320.
© 2023, ICROS, KIEE and Springer.
- Complex network
- directed random graph
- random edge attack
FingerprintDive into the research topics of 'Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal Attacks'. Together they form a unique fingerprint.
- 1 Curtailed
LOU, Y. F. & WONG, M. L.
1/01/22 → 18/03/22
Project: Grant Research