Abstract
Finding the solution for driving a complex network at the minimum energy cost with a given number of controllers, known as the minimum-cost control problem, is critically important but remains largely open. We propose a projected gradient method to tackle this problem, which works efficiently in both synthetic and real-life networks. The study is then extended to the case where each controller can only be connected to a single network node to have the lowest connection complexity. We obtain the interesting insight that such connections basically avoid high-degree nodes of the network, which is in resonance with recent observations on controllability of complex networks. Our results provide the first technical path to enabling minimum-cost control of complex networks, and contribute new insights to locating the key nodes from a minimum-cost control perspective.
Highlights
24 December 2015Guoqi Li1,2, Wuhua Hu2, Gaoxi Xiao, Lei Deng, Pei Tang, Jing Pei and Luping Shi
The control of network systems is an important problem with wide applications
The algorithm can handle networks at these and larsizes efficiently, though numerically solving the minimum-cost control problem for extra-large networks with hundreds of thousands or millions of nodes remains as a challenge
Summary
Guoqi Li1,2, Wuhua Hu2, Gaoxi Xiao, Lei Deng, Pei Tang, Jing Pei and Luping Shi. The study is extended to the case where each controller attribution to the author(s) and the title of can only be connected to a single network node to have the lowest connection complexity. Journal citation the interesting insight that such connections basically avoid high-degree nodes of the network, which and DOI. Our results provide the first technical path to enabling minimum-cost control of complex networks, and contribute new insights to locating the key nodes from a minimum-cost control perspective
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have