Target controllability: a feed-forward greedy algorithm in complex networks, meeting Kalman's rank condition.

ABSTRACT:

Motivation

The concept of controllability within complex networks is pivotal in determining the minimal set of driver vertices required for the exertion of external signals, thereby enabling control over the entire network's vertices. Target controllability further refines this concept by focusing on a subset of vertices within the network as the specific targets for control, both of which are known to be NP-hard problems. Crucially, the effectiveness of the driver set in achieving control of the network is contingent upon satisfying a specific rank condition, as introduced by Kalman. On the other hand, structural controllability provides a complementary approach to understanding network control, emphasizing the identification of driver vertices based on the network's structural pr

SUBMITTER: Khezri SF 

PROVIDER: S-EPMC11568069 | biostudies-literature | 2024 Nov

REPOSITORIES: biostudies-literature