Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have