Weakly interacting particles on dense graph sequences
vendredi 16 octobre 2020, 9h30 - 10h30
This exposé presents some recent result on weakly interacting particles, where the connections among the particles are encoded in a general graph sequence. The classical mean-field behavior, identifiable as a particle system on a sequence of complete graphs, has been shown to be valid on « homogeneous » graph sequences as well; however, random graphs built from graphons lead to different « inhomogeneous » behaviors. The aim of this talk is to clarify the concept of « homogeneous/inhomogeneous » behavior and to show a direct link between graph limits theory and the convergence of particle systems on graphs.
Joint work with G. Bet and F. Nardi.