Abstract
SummaryControllability of complex networks is a fundamental requirement to orientate the networks toward a sustainable way of development. Determination of link weights and calculation of eigenvalues of large‐scale matrices are two inevitable problems in applying the exact controllability framework in complex networks. Here, we introduce a novel controllability analysis approach based on the controllability index and the reachability matrix to identify the minimum set of driver nodes, in order to achieve complete regulation of arbitrary networks with general configurations. An effective algorithm is theoretically developed via using only the 0–1 binary structure of the network. Theoretical analysis and numerical examples show that our proposed algorithm possesses structural adaptability and control robustness under the weighted perturbation. Copyright © 2017 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Robust and Nonlinear Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
