pith. sign in

arxiv: 1905.01630 · v1 · pith:46FHDHF6new · submitted 2019-05-05 · 💻 cs.SY · cs.SI· cs.SY· physics.soc-ph

On the Controllability of Clustered Scale-Free Networks

classification 💻 cs.SY cs.SIcs.SYphysics.soc-ph
keywords controllabilityscale-freeclusterednetworkscontrolnumbersizedilations
0
0 comments X
read the original abstract

In this paper, we compare the number of unmatched nodes and the size of dilations in two main random network models, the Scale-Free and Clustered Scale-Free 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 Scale-Free networks require fewer control inputs for controllability. Further, the average size of dilations is smaller in clustered Scale-Free networks, implying that potentially fewer options for controllability recovery are available.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.