arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.03787math.DSnlin.AO
收藏

稀疏随机图上Kuramoto模型的连续极限

The continuum limit of the Kuramoto model on sparse random graphs

Georgi S. Medvedev

摘要:

本文研究了耦合动力系统在图的收敛序列上收敛到连续极限的问题。证明了当图的大小趋于无穷大时,收敛图序列上的动力系统的初值问题的解趋于单位区间上的非局部扩散方程的解.我们改进了[Arch. Ration.机械分析:21(2014),pp. 781--803],并将其推广到更大的图类,包括有向图和无向图、稀疏图和稠密图、随机图和确定图。我们的方法有三个主要组成部分。首先,我们采用了一个灵活的框架,将随机图的相互作用的动力系统,这与连续极限的推导无缝配合的模型。接下来,我们证明了平均原理近似随机图上的动力系统的确定性(平均)对应。证明覆盖系统的稀疏图,并产生几乎必然收敛的时间间隔的顺序$\log n,$,其中$n$是顶点数。最后,一个Galerkin格式的发展,以显示收敛的平均模型的连续极限。本文的分析涵盖了仓本模型的耦合相位振荡器的各种图形,包括稀疏Erdens-R {\' e}nyi,小世界,幂律图。

英文摘要:

In this paper, we study convergence of coupled dynamical systems on convergent sequences of graphs to a continuum limit. We show that the solutions of the initial value problem for the dynamical system on a convergent graph sequence tend to that for the nonlocal diffusion equation on a unit interval, as the graph size tends to infinity. We improve our earlier results in [Arch. Ration. Mech. Anal., 21 (2014), pp. 781--803] and extend them to a larger class of graphs, which includes directed and undirected, sparse and dense, random and deterministic graphs. There are three main ingredients of our approach. First, we employ a flexible framework for incorporating random graphs into the models of interacting dynamical systems, which fits seamlessly with the derivation of the continuum limit. Next, we prove the averaging principle for approximating a dynamical system on a random graph by its deterministic (averaged) counterpart. The proof covers systems on sparse graphs and yields almost sure convergence on time intervals of order $\log n,$ where $n$ is the number of vertices. Finally, a Galerkin scheme is developed to show convergence of the averaged model to the continuum limit. The analysis of this paper covers the Kuramoto model of coupled phase oscillators on a variety of graphs including sparse Erdős-R{\' e}nyi, small-world, and power law graphs.

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

↑