Controllability Metrics, Limitations and Algorithms for Complex Networks
Fabio Pasqualetti, Sandro Zampieri, Francesco Bullo

TL;DR
This paper introduces new metrics, bounds, and algorithms to analyze and improve the controllability of complex networks, highlighting limitations and properties based on network structure and control node placement.
Contribution
It proposes a controllability difficulty metric, derives bounds relating control energy and control nodes, and develops an open-loop control strategy with performance guarantees.
Findings
Control energy can grow exponentially with network size if control nodes are fixed.
Certain networks can be controlled with constant energy if control nodes are a fixed fraction of the network.
Clustered networks may be easier to control due to their structure.
Abstract
This paper studies the problem of controlling complex networks, that is, 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 (i) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, (ii) 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 (iii) 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: (i) if the number of control…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Opportunistic and Delay-Tolerant Networks
