  This paper deals with the derivation of the mean-field limit for multi-agent
systems on a large class of sparse graphs. More specifically, the case of
non-exchangeable multi-agent systems consisting of non-identical agents is
addressed. The analysis does not only involve PDEs and stochastic analysis but
also graph theory through a new concept of limits of sparse graphs (extended
graphons) that reflect the structure of the connectivities in the network and
has critical effects on the collective dynamics. In this article some of the
main restrictive hypothesis in the previous literature on the connectivities
between the agents (dense graphs) and the cooperation between them (symmetric
interactions) are removed.
