COMPLEX NETWORKS Degrees of control

被引：40

作者：

Egerstedt, Magnus ^{[1
]}

机构：

[1] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA

来源：

NATURE | 2011年 / 473卷 / 7346期

关键词：

CONTROLLABILITY;

D O I：

10.1038/473158a

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

One might expect that social networks would generally be harder to control than naturally occurring systems such as biological networks. But this is not so, according to a new study. See Article p.167

引用

页码：158 / 159

页数：2

共 6 条

[1]

Kalman R. E., 1963, Journal of the Society for Industrial and Applied Mathematics, Series A: Control, V1, P152, DOI DOI 10.1137/0301010

[2] STRUCTURAL CONTROLLABILITY [J].

LIN, CT .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (03) :201-208

[3] Controllability of complex networks [J].

Liu, Yang-Yu ;

Slotine, Jean-Jacques ;

Barabasi, Albert-Laszlo .

NATURE, 2011, 473 (7346) :167-173

[4]

Mesbahi M, 2010, GRAPH THEORETIC METHODS IN MULTIAGENT NETWORKS, P1

[5] CONTROLLABILITY OF MULTI-AGENT SYSTEMS FROM A GRAPH-THEORETIC PERSPECTIVE [J].

Rahman, Amirreza ;

Ji, Meng ;

Mesbahi, Mehran ;

Egerstedt, Magnus .

SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2009, 48 (01) :162-186

[6] On the controllability of nearest neighbor interconnections [J].

Tanner, HG .

2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, :2467-2472

← 1 →