Control efficacy of complex networks

Xin-Dong Gao, Wen-Xu Wang, Ying-Cheng Lai

Research output: Contribution to journalArticle

5 Citations (Scopus)
5 Downloads (Pure)

Abstract

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver node. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.
Original languageEnglish
Article number28037
Pages (from-to)1-12
Number of pages12
JournalScientific Reports
Volume6
DOIs
Publication statusPublished - 21 Jun 2016

Fingerprint

Complex networks
Controllability
Topology

Cite this

Gao, X-D., Wang, W-X., & Lai, Y-C. (2016). Control efficacy of complex networks. Scientific Reports, 6, 1-12. [28037]. https://doi.org/10.1038/srep28037

Control efficacy of complex networks. / Gao, Xin-Dong; Wang, Wen-Xu; Lai, Ying-Cheng.

In: Scientific Reports, Vol. 6, 28037, 21.06.2016, p. 1-12.

Research output: Contribution to journalArticle

Gao, X-D, Wang, W-X & Lai, Y-C 2016, 'Control efficacy of complex networks', Scientific Reports, vol. 6, 28037, pp. 1-12. https://doi.org/10.1038/srep28037
Gao X-D, Wang W-X, Lai Y-C. Control efficacy of complex networks. Scientific Reports. 2016 Jun 21;6:1-12. 28037. https://doi.org/10.1038/srep28037
Gao, Xin-Dong ; Wang, Wen-Xu ; Lai, Ying-Cheng. / Control efficacy of complex networks. In: Scientific Reports. 2016 ; Vol. 6. pp. 1-12.
@article{6a6d74f2a31240fb97b302b05393c2ad,
title = "Control efficacy of complex networks",
abstract = "Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver node. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.",
author = "Xin-Dong Gao and Wen-Xu Wang and Ying-Cheng Lai",
note = "Acknowledgements W.-X.W. was supported by CNNSF under Grant No. 61573064, and No. 61074116 the Fundamental Research Funds for the Central Universities and Beijing Nova Programme, China. Y.-C.L. was supported by ARO under Grant W911NF-14-1-0504.",
year = "2016",
month = "6",
day = "21",
doi = "10.1038/srep28037",
language = "English",
volume = "6",
pages = "1--12",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",

}

TY - JOUR

T1 - Control efficacy of complex networks

AU - Gao, Xin-Dong

AU - Wang, Wen-Xu

AU - Lai, Ying-Cheng

N1 - Acknowledgements W.-X.W. was supported by CNNSF under Grant No. 61573064, and No. 61074116 the Fundamental Research Funds for the Central Universities and Beijing Nova Programme, China. Y.-C.L. was supported by ARO under Grant W911NF-14-1-0504.

PY - 2016/6/21

Y1 - 2016/6/21

N2 - Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver node. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

AB - Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver node. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

U2 - 10.1038/srep28037

DO - 10.1038/srep28037

M3 - Article

VL - 6

SP - 1

EP - 12

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

M1 - 28037

ER -