On the Controllability of Clustered Scale-Free Networks

May 05, 2019 ยท Declared Dead ยท ๐Ÿ› Journal of Complex Networks

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mohammadreza Doostmohammadian, Usman A. Khan arXiv ID 1905.01630 Category eess.SY: Systems & Control (EE) Cross-listed cs.SI, physics.soc-ph Citations 8 Venue Journal of Complex Networks Last Checked 2 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Systems & Control (EE)

Died the same way โ€” ๐Ÿ‘ป Ghosted