Global stochastic exponential consensus of multi-agent networks

In this paper, focused on the influence of noise, global stochastic exponential consensus seeking problem is considered for networked agents on general connected digraphs. The stochastic noises are assumed to be Wiener processes that affect not only the network coupling but also the overall network. Based on algebraic graph theory and stochastic analysis techniques, a novel general criteria for global almost sure exponential consensus is established. It is shown that that global consensus can be achieved almost surely over general digraph under certain coupling strength and noise conditions. Finally, one example with numerical simulation is worked out for illustration.