On the Controllability of Clustered Scale-Free Networks
arXiv:1905.01630
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.
References in corpus (13)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Growing Scale-Free Networks with Tunable Clustering
- Scale-free topology of e-mail networks
- Control Principles of Complex Networks
- Highly clustered scale-free networks
- Epidemic threshold in structured scale-free networks
- A Model for Social Networks
- Tuning clustering in random networks with arbitrary degree distributions
- On the genericity properties in networked estimation: Topology design and sensor placement
- Cyber-Social Systems: Modeling, Inference, and Optimal Design
- Graphic-theoretic distributed inference in social networks
- Distributed Estimation Recovery under Sensor Failure