Structural controllability analysis of complex networks

How to exactly acquire link weights and high complexity of calculating eigenvalues of large-scale matrices are two inevitable problems in applying exact controllability framework to controllability of complex networks. To achieve complete regulation of arbitrary networks of general configurations, we here introduce a new structural controllability analysis approach based on the reachability matrix to identify the minimum set of driver nodes. Furthermore, we investigate the impact of network topology on controllability by means of robustness measure of network against random failures and malicious attacks, which could further deepen our understanding of controlling complex networks.