.png){kind=icon}
.png){kind=icon}
Return
Controllability emerging from conditional path reachability in complex networks
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.3836.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Controllability of complex networks is a fundamental requirement to orientate the networks toward a sustainable way of development. Determination of link weights and calculation of eigenvalues of large-scale matrices are two inevitable problems in applying the exact controllability framework in complex networks. Here, we introduce a novel controllability analysis approach based on the controllability index and the reachability matrix to identify the minimum set of driver nodes, in order to achieve complete regulation of arbitrary networks with general configurations. An effective algorithm is theoretically developed via using only the 0-1 binary structure of the network. Theoretical analysis and numerical examples show that our proposed algorithm possesses structural adaptability and control robustness under the weighted perturbation. Copyright (c) 2017 John Wiley & Sons, Ltd.
Keywords:
uncertain complex networks
robustness
controllability
path reachability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W