Graph limit

Mean-field limit of non-exchangeable multi-agent systems over hypergraphs with unbounded rank

Interacting particle systems are known for their ability to generate large-scale self-organized structures from simple local interaction rules between each agent and its neighbors. In addition to studying their emergent behavior, a main focus of the …

Large-population limits of non-exchangeable particle systems

A particle system is said to be non-exchangeable if two particles cannot be exchanged without modifying the overall dynamics. Because of this property, the classical mean-field approach fails to provide a limit equation when the number of particles …

Graph limit for interacting particle systems on weighted random graphs

In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of graphons. …

Mean-field and graph limits for collective dynamics models with time-varying weights

In this paper, we study a model for opinion dynamics where the influence weights of agents evolve in time via an equation which is coupled with the opinions’ evolution. We explore the natural question of the large population limit with two …