符号图与图极限上的意见动力学
Opinion Dynamics on Signed Graphs and Graphons
AI总结:
本文利用图极限理论研究大型无向网络上的意见动力学,定义了符号图极限上的排斥与对立动力学并证明解的存在唯一性,且证明图极限动力学可良好近似大型图上的动力学,并为W-随机图提供了新的收敛性结果。
摘要:
本文利用图极限理论研究大型无向网络上的意见动力学。我们所考虑的意见动力学模型允许个体之间存在负向交互,因此个体意见可能趋于分化。我们同时考虑了文献中已研究的排斥模型和对立模型这两种负向交互形式。我们在符号图极限上定义了排斥动力学和对立动力学,并证明了其初值问题解的存在性与唯一性。随后我们证明,在适当的意义下,图极限动力学是对收敛于某个图极限的大型图上动力学的一个良好近似。该结果适用于根据图极限采样得到的大型随机图(W-随机图),我们为此类图在非常一般的假设下提供了新的收敛性结果。
英文摘要:
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, whose opinions can thus grow apart. We consider both the repelling and the opposing models of negative interactions, which have been studied in the literature. We define the repelling and the opposing dynamics on signed graphons and we show that their initial value problem solutions exist and are unique. We then show that, in a suitable sense, the graphon dynamics is a good approximation of the dynamics on large graphs that converge to a graphon. This result applies to large random graphs that are sampled according to a graphon (W-random graphs), for which we provide a new convergence result under very general assumptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。