Control backbone: An index for quantifying a node's importance for the network controllability

被引:7
作者
Ding, Jin [1 ]
Lu, Yong-Zai
机构
[1] Zhejiang Univ, State Key Lab Ind Control Technol, Hangzhou 310027, Zhejiang, Peoples R China
关键词
Control backbone; Minimal control scheme; Maximum matching; Network controllability; Complex networks; COMPLEX NETWORKS; STRUCTURAL CONTROLLABILITY; COMMUNITY STRUCTURE; CENTRALITY; SYNCHRONIZATION; DYNAMICS; RESET;
D O I
10.1016/j.neucom.2014.11.024
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Control over complex networks has been one of the attractive research areas for both network and control community, and has yielded many promising and significant results. Yet few studies have been dedicated to exploiting a single node's effort in the control of the network. In this paper, we introduce the concept of control backbone to quantify a node's importance for maintaining the structural controllability of the network. And a random sampling algorithm is developed to effectively compute it. Moreover, we demonstrate the distribution of the control backbone on various real and model networks and find that it is mainly determined by the network's underlying degree distribution. We also find the control backbone of a given node is positively correlated to its local topological feature, the ratio of the number of its siblings to the number of its superiors. Inspired by this relationship, we devise an attack strategy against the structural controllability of malicious networks. The simulation results on real and model networks show its effectiveness and efficiency compared to other commonly used attack strategies. The presented findings can help us further understand the relationship between the network's structural characteristics and its control. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:309 / 318
页数:10
相关论文
共 61 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]   The network takeover [J].
Barabasi, Albert-Laszlo .
NATURE PHYSICS, 2012, 8 (01) :14-16
[5]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[6]  
Bollobs B., 2001, RANDOM GRAPHS, V2nd
[7]  
BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631
[8]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[9]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[10]   Data clustering using controlled consensus in complex networks [J].
Cupertino, Thiago H. ;
Huertas, Jean ;
Zhao, Liang .
NEUROCOMPUTING, 2013, 118 :132-140