arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.02868math.DSmath.CAnlin.AO
收藏

Kuramoto型模型的Graphop平均场极限

Graphop Mean-Field Limits for Kuramoto-Type Models

Marios-Antonios Gkogkas, Christian Kuehn

摘要:

最初出现在统计物理学中的相互作用粒子系统的背景下,网络/图上的动力系统和微分方程已经渗透到广泛的数学领域以及许多应用中。该领域中的一个中心问题是当节点/顶点的数量趋于无穷大时找到动力学的合适近似,即,在大图的限制。在这种情况下的基石是描述平均场水平上的粒子密度的弗拉索夫-福克-普朗克方程(VFPE)。对于全对全耦合系统,证明VFPE对许多类粒子系统的严格逼近是非常经典的。对于收敛到图子极限的稠密图,我们也知道平均场近似对某些类型的模型成立,例如,图上的仓本模型。然而,中间密度和稀疏图的空间显然是非常相关的。在这里,我们证明了仓本模型可以近似的平均场极限更一般的图形限制比graphons。具体而言,我们的贡献如下。(I)我们展示了如何通过考虑graphops将更抽象的算子理论引入VFPE。Graphops最近被提出作为图极限理论的统一方法,在这里我们证明它们可以用于图上的微分方程。(II)对于图上的仓本模型,我们严格证明了存在一个VFPE方程在平均场意义下近似它。(III)这个平均场VFPE涉及一个图形,我们证明了存在性,唯一性和连续的图形依赖的弱解。(IV)在技术层面上,我们的研究结果依赖于设计一个新的合适的度量graphop收敛和傅里叶分析上的紧阿贝尔群近似graphops使用可和性内核。

英文摘要:

Originally arising in the context of interacting particle systems in statistical physics, dynamical systems and differential equations on networks/graphs have permeated into a broad number of mathematical areas as well as into many applications. One central problem in the field is to find suitable approximations of the dynamics as the number of nodes/vertices tends to infinity, i.e., in the large graph limit. A cornerstone in this context are Vlasov-Fokker-Planck equations (VFPEs) describing a particle density on a mean-field level. For all-to-all coupled systems, it is quite classical to prove the rigorous approximation by VFPEs for many classes of particle systems. For dense graphs converging to graphon limits, one also knows that mean-field approximation holds for certain classes of models, e.g., for the Kuramoto model on graphs. Yet, the space of intermediate density and sparse graphs is clearly extremely relevant. Here we prove that the Kuramoto model can be be approximated in the mean-field limit by far more general graph limits than graphons. In particular, our contributions are as follows. (I) We show, how to introduce operator theory more abstractly into VFPEs by considering graphops. Graphops have recently been proposed as a unifying approach to graph limit theory, and here we show that they can be used for differential equations on graphs. (II) For the Kuramoto model on graphs we rigorously prove that there is a VFPE equation approximating it in the mean-field sense. (III) This mean-field VFPE involves a graphop, and we prove the existence, uniqueness, and continuous graphop-dependence of weak solutions. (IV) On a technical level, our results rely on designing a new suitable metric of graphop convergence and on employing Fourier analysis on compact abelian groups to approximate graphops using summability kernels.

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

↑