Structural controllability, minimum rank and constrained matchings
Maguy Tréfois, Guevara Lema, Airlie Chapman, Jean‐Charles Delvenne · 2010
It is well known that such a system is controllable if and only if its controllability matrix is full rank. However, in many real networks the interaction strengths between the components of the system (that is, the matrix A) are unknown. In such cases, the rank of the controllability matrix cannot be used to study the controllability of the system. That is why the structural controllability has been introduced. What we are really interested in is identifying a minimum node set to control (the driver nodes) in order to have full control over the system. In this presentation, we will present the strong structural controllability, briefly presented below.