On Almost Controllability of Dynamical Complex Networks with Noises

This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman controllability. The concept of almost controllability is elaborated by both theoretical...

Full description

Saved in:
Bibliographic Details
Published inJournal of systems science and complexity Vol. 32; no. 4; pp. 1125 - 1139
Main Authors Cai, Ning, He, Ming, Wu, Qiuxuan, Khan, M. Junaid
Format Journal Article
LanguageEnglish
Published Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.08.2019
Springer Nature B.V
Subjects
Complex Systems
Control
Controllability
Mathematics
Mathematics and Statistics
Mathematics of Computing
Operations Research/Decision Theory
Statistics
Systems Theory
complex network
Communication link
weight
controllability
Online AccessGet full text

Cover

More Information
Summary:This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman controllability. The concept of almost controllability is elaborated by both theoretical discussions and experimental verifications.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1009-6124
1559-7067
DOI:10.1007/s11424-017-6273-7