Controllability of complex networks with unilateral inputs

• Main Authors: Gustav Lindmark, Claudio Altafini
• Format: Article
• Language: English
• Published: Nature Publishing Group 2017-05-01
• Series: Scientific Reports
• Online Access: https://doi.org/10.1038/s41598-017-01846-6

Abstract In this paper, we study the problem of controlling complex networks with unilateral controls, i.e., controls which can assume only positive or negative values, not both. Given a complex network represented by the adjacency matrix A, an algorithm is developed that constructs an input matrix B such that the resulting system (A, B) is controllable with a near minimal number of unilateral control inputs. This is made possible by a reformulation of classical conditions for controllability that casts the minimal unilateral input selection problem into well known optimization problems. We identify network properties that make unilateral controllability relatively easy to achieve as compared to unrestricted controllability. The analysis of the network topology for instance allows us to establish theoretical bounds on the minimal number of controls required. For various categories of random networks as well as for a number of real-world networks these lower bounds are often achieved by our heuristics.