On Almost Controllability of Dynamical Complex Networks with Noises
arXiv:1706.0089068 citations
AI Analysis
Provides a theoretical foundation for controllability of noisy complex networks, relevant to network control theory.
This paper shows that almost any weighted complex network with noise on communication link strengths is controllable in the Kalman sense, supported by theory and experiments.
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.