World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Consensus formation in first-order graphon models with time-varying topologies

    https://doi.org/10.1142/S0218202522500518Cited by:9 (Source: Crossref)

    In this paper, we investigate the asymptotic formation of consensus for several classes of time-dependent cooperative graphon dynamics. After motivating the use of this type of macroscopic models to describe multi-agent systems, we adapt the classical notion of scrambling coefficient to this setting, and leverage it to establish sufficient conditions ensuring the exponential convergence to consensus with respect to the L-norm topology. We then shift our attention to consensus formation expressed in terms of the L2-norm, and prove three different results for symmetric, balanced and strongly connected topologies, which involve a suitable generalisation of the notion of algebraic connectivity to this infinite-dimensional framework. We then show that, just as in the finite-dimensional setting, the notion of algebraic connectivity that we propose encodes information about the connectivity properties of the underlying interaction topology. We finally use the corresponding results to shed some light on the relation between L2- and L-consensus formation, and illustrate our contributions by a series of numerical simulations.

    Communicated by F. Flandoli

    AMSC: 05C63, 05C90, 37L15, 93A16
    Remember to check out the Most Cited Articles!

    View our Mathematical Modelling books
    Featuring authors Frederic Y M Wan, Gregory Baker and more!