Collective Behavior of Multileader Multiagent Systems With Random Interactions Over Signed Digraphs

Signed digraphs have been developed in multiagent systems to explain cooperative and competitive interactions among agents. This article explores the collective behavior for a group of generic linear agents interacting by the random interaction manner on signed digraphs in the presence of multiple leaders. In the setting of random interactions, the information interaction between neighboring agents may fail at each time step, which is described by a Bernoulli random variable. The global almost sure convergence of the system is solved by using the convergence analysis method of products of infinite substochastic matrices. Moreover, an application about opinion dynamics of social networks is given. In the end, the theoretical research results are verified through simulation experiments.

Automated summary

This article explores the collective behavior of a group of generic linear agents interacting by random interaction on signed digraphs in the presence of multiple leaders. The global almost sure convergence of the system is solved by using the convergence analysis method of products of infinite substochastic matrices, and the theoretical research results are verified through simulation experiments.