arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.08372physics.soc-phcs.SYeess.SY
收藏

符号图与图子上的观点动力学:超越分段常数情形(扩展版)

Opinion dynamics on signed graphs and graphons: Beyond the piece-wise constant case (Extended version)

Raoul Prisant, Federica Garin, Paolo Frasca

AI总结:

本文利用图子理论分析大型无向网络中的排斥与对立观点动力学,证明图子初值问题解的存在唯一性,并证明图子动力学可近似收敛到图子的大型图动力学,适用于按图子采样的大型随机图。

摘要:

本文利用图子理论研究大型无向网络上的观点动力学。我们所考虑的观点动力学模型允许个体之间存在负向交互,即存在观点可能逐渐分化的竞争实体。我们同时考虑文献中已研究的排斥模型和对立模型。我们在图子上定义排斥动力学和对立动力学,并证明其初值问题的解存在且唯一。随后我们证明图子动力学能够很好地近似收敛到某一图子的大型图上的动力学。该结果适用于按照某一图子采样得到的大型随机图。所有这些事实都在一个扩展的数值例子中得到了说明。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑