On the controllability of clustered Scale-Free networks

In this article, we compare the number of unmatched nodes and the size of dilations in two main random network models, the Scale-Free (SF) and Clustered Scale-Free (CSF) networks. The number of unmatched nodes determines the necessary number of control inputs and is known to be a measure for network controllability, while the size of dilation is a measure of controllability recovery in case of control-input failure. Our results show that clustered version of SF networks require fewer control inputs for controllability. Further, the average size of dilations is smaller in CSF networks, implying that potentially fewer options for controllability recovery are available.