Controllability Metrics, Limitations and Algorithms for Complex Networks
Top Cited Papers
- 11 March 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 1 (1), 40-52
- https://doi.org/10.1109/tcns.2014.2310254
Abstract
This paper studies the problem of controlling complex networks, i.e., the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem, 1) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, 2) we derive bounds based on the system dynamics (network topology and weights) to characterize the tradeoff between the control energy and the number of control nodes, and 3) we propose an open-loop control strategy with performance guarantees. In our strategy, we select control nodes by relying on network partitioning, and we design the control input by leveraging optimal and distributed control techniques. Our findings show several control limitations and properties. For instance, for Schur stable and symmetric networks: 1) if the number of control nodes is constant, then the control energy increases exponentially with the number of network nodes; 2) if the number of control nodes is a fixed fraction of the network nodes, then certain networks can be controlled with constant energy independently of the network dimension; and 3) clustered networks may be easier to control because, for sufficiently many control nodes, the control energy depends only on the controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks, social networks and epidemics spreading.Keywords
Other Versions
This publication has 37 references indexed in Scilit:
- Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex NetworksPLOS ONE, 2012
- Dynamics and control of state-dependent networks for probing genomic organizationProceedings of the National Academy of Sciences of the United States of America, 2011
- Controllability of complex networksNature, 2011
- Stability of graph communities across time scalesProceedings of the National Academy of Sciences of the United States of America, 2010
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Bounds in algebraic Riccati and Lyapunov equations: a survey and some new resultsInternational Journal of Control, 1996
- Method for optimal actuator and sensor placement for large flexible structuresJournal of Guidance, Control, and Dynamics, 1992
- Measures of modal controllability and observability for first- and second-order linear systemsJournal of Guidance, Control, and Dynamics, 1989
- Reaching a ConsensusJournal of the American Statistical Association, 1974
- Norms and exclusion theoremsNumerische Mathematik, 1960