Opinion dynamics on signed graphs and graphons: Beyond the piece-wise constant case (Extended version)
Abstract
In this paper we make use of graphon theory to study opinion dynamics on large undirected networks. The opinion dynamics models that we take into consideration allow for negative interactions between the individuals, i.e. competing entities whose opinions can grow apart. We consider both the repelling model and the opposing model that are studied in the literature. We define the repelling and the opposing dynamics on graphons and we show that their initial value problem's solutions exist and are unique. We then show that the graphon dynamics well approximate the dynamics on large graphs that converge to a graphon. This result applies to large random graphs that are sampled according to a graphon. All these facts are illustrated in an extended numerical example.
Cite
@article{arxiv.2404.08372,
title = {Opinion dynamics on signed graphs and graphons: Beyond the piece-wise constant case (Extended version)},
author = {Raoul Prisant and Federica Garin and Paolo Frasca},
journal= {arXiv preprint arXiv:2404.08372},
year = {2024}
}
Comments
8 double-column pages. This revised version corrects several typos. An abridged version is going to appear in the proceedings of the 2024 IEEE Conference on Decision and Control