Control capacity and a random sampling method in exploring controllability of complex networks

Controlling complex systems is a fundamental challenge of network science. Recent advances indicate that control over the system can be achieved through a minimum driver node set (MDS). The existence of multiple MDS's suggests that nodes do not participate in control equally, prompting us to quantify their participations. Here we introduce control capacity quantifying the likelihood that a node is a driver node. To efficiently measure this quantity, we develop a random sampling algorithm. This algorithm not only provides a statistical estimate of the control capacity, but also bridges the gap between multiple microscopic control configurations and macroscopic properties of the network under control. We demonstrate that the possibility of being a driver node decreases with a node's in-degree and is independent of its out-degree. Given the inherent multiplicity of MDS's, our findings offer tools to explore control in various complex systems.


More publications
M. Pósfai, Y.-Y. Liu, J.-J. Slotine, A.-L. Barabási

Scientific Reports 3:1067, 1-7 (2013)

Albert-László Barabási

Philosophical Transactions of The Royal Society 371, 1-3 (2013)

B. Barzel, A.-L. Barabási

Nature Physics 9, 673-681 (2013)