Abstract
In the controllability study of complex networks,there are basically two core issues:The minimal number of inputs and the minimal number of controlled nodes needed to achieve full control.Liu and Barabasi applied the modern control theory to the investigation of network structural controllability of linear dynamical systems and proposed a method to calculate the minimal number of inputs.This solves the computable problem of the complex network structural controllability.As to undirected or weighted networks in real networks,the paper introduces the concept of node control capacity for them.By using the method of adding inputs or edges,we propose algorithms to identify the minimal set of driver nodes as well as the approximately minimal set of controlled nodes to ensure the full control of network.
Sign-in/Register to access full text options 
Free) 
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 call
