On Almost Controllability of Dynamical Complex Networks with Noises

TL;DR

This paper investigates the controllability of complex networks with noisy communication links, demonstrating that most such networks are controllable in the Kalman sense through theoretical analysis and experiments.

Contribution

It introduces the concept of almost controllability for noisy complex networks and provides theoretical and experimental validation of this property.

Findings

Most weighted complex networks with noise are controllable.

Almost controllability holds in the sense of Kalman controllability.

Theoretical and experimental evidence supports the concept.

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.