Graph Distances and Controllability of Networks

Abstract

In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the graph distances between the agents. More specifically, we present a graph topological lower bound on the rank of the controllability matrix. This lower bound is tight, and it is applicable to systems with arbitrary network topologies, coupling weights, and number of leaders. An algorithm for computing the lower bound is also provided. Furthermore, as a prominent application, we present how the proposed bound can be utilized to select a minimal set of leaders for achieving controllability, even when the coupling weights are unknown.

Accepted to the IEEE Transactions on Automatic Control

References in corpus (2)

• Controllability of Brain Networks
• Control centrality and hierarchical structure in complex networks

Cited by in corpus (7)

• Laplacian Dynamics on Cographs: Controllability Analysis through Joins and Unions
• Strongly uncontrollable network topologies
• Controllability Analysis of Threshold Graphs and Cographs
• Fixed Node Determination and Analysis in Directed Acyclic Graphs of Structured Networks
• Structural Robustness to Noise in Consensus Networks: Impact of Degrees and Distances, Fundamental Limits, and Extremal Graphs
• Controllability of LTI Networked Systems with Heterogeneous Dynamics
• Composition Rules for Strong Structural Controllability and Minimum Input Problem in Diffusively-Coupled Networks