Robustness of Network Controllability with Respect to Node Removals Based on In-Degree and Out-Degree
Network controllability and its robustness have been widely studied. However, analytical methods to calculate network controllability with respect to node in- and out-degree targeted removals are currently lacking. This paper develops methods, based on generating functions for the in- and out-degree...
Main Authors: | Fenghua Wang, Robert E. Kooij |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/4/656 |
Similar Items
-
The recoverability of network controllability with respect to node additions
by: Fenghua Wang, et al.
Published: (2023-01-01) -
Effect of Weight Thresholding on the Robustness of Real-World Complex Networks to Central Node Attacks
by: Jisha Mariyam John, et al.
Published: (2023-08-01) -
A Novel Method to Identify Key Nodes in Complex Networks Based on Degree and Neighborhood Information
by: Na Zhao, et al.
Published: (2024-01-01) -
Quantifying the Robustness of Complex Networks with Heterogeneous Nodes
by: Prasan Ratnayake, et al.
Published: (2021-11-01) -
Link prediction method for dynamic networks based on matching degree of nodes
by: Cong LI, et al.
Published: (2022-08-01)