Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions

In this article, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this article, we present necessary and sufficient conditions for the controllability of cographs,...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2021-03, Vol.66 (3), p.1383-1390
Main Authors: Mousavi, Shima Sadat, Haeri, Mohammad, Mesbahi, Mehran
Format: Article
Language:English
Subjects:
Cographs
Computational complexity
Controllability
Eigenvalues and eigenfunctions
Graph theory
Laplacian dynamics
Modularity
network controllability
Network theory (graphs)
Nodes
Partitions
Stability
threshold graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this article, we present necessary and sufficient conditions for the controllability of cographs, and provide an efficient method for selecting a minimal set of input nodes from which the network is controllable. In particular, we define a sibling partition in a cograph and show that the network is controllable if all nodes of any cell of this partition except one are chosen as control nodes. The key ingredient for such characterizations is the intricate connection between the modularity of cographs and their modal properties. Finally, we use these results to characterize the controllability conditions for certain subclasses of cographs.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2020.2992444