Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes

Abstract

The problem of controllability of the dynamical state of a network is central in network theory and has wide applications ranging from network medicine to financial markets. The driver nodes of the network are the nodes that can bring the network to the desired dynamical state if an external signal is applied to them. Using the framework of structural controllability, here we show that the density of nodes with in-degree and out-degree equal to $0$, $1$ and $2$ determines the number of driver nodes of random networks. Moreover we show that networks with minimum in-degree and out-degree greater than 2, are always fully controllable by an infinitesimal fraction of driver nodes, regardless on the other properties of the degree distribution. Finally, based on these results, we propose an algorithm to improve the controllability of networks.

(9 pages, 4 figures)

References in corpus (4)

• Critical phenomena in complex networks
• Pinning-controllability of complex networks
• Emergence of bimodality in controlling complex networks
• Scale-free networks with an exponent less than two

Cited by in corpus (8)

• A Learning Convolutional Neural Network Approach for Network Robustness Prediction
• The theory of percolation on hypergraphs
• Stochastic cycle selection in active flow networks
• SPP-CNN: An Efficient Framework for Network Robustness Prediction
• One-loop diagrams in the Random Euclidean Matching Problem
• General theory for extended-range percolation on simple and multiplex networks
• Altering control modes of complex networks based on edge removal
• Phase transition in the bipartite z-matching