arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.00518nlin.AO
收藏

Kuramoto振子的最优同步:降维方法

Optimal synchronization of Kuramoto oscillators: a dimensional reduction approach

Rafael S. Pinto, Alberto Saa

摘要:

最近提出的降维方法研究同步在仓本模型中建立最佳的网络拓扑结构,以促进或抑制同步。该方法的基础是在一个集体坐标的锁相振荡器的时间演化的介绍,在的精神,安东森anquiry。我们证明了仓本网络的最优同步要求二次函数$ω^T L ω$的最大化,其中$ω$代表振荡器的固有频率的向量,和$L$网络的拉普拉斯矩阵。许多最近得到的数值结果可以重新获得解析和更简单的方式从我们的最大化条件。提出了一种计算效率高的{爬山}重布线算法来生成具有最佳同步特性的网络。我们的方法可以很容易地适应的情况下,仓本模型的吸引力和排斥力的相互作用,并再次许多最近的数值结果可以重新推导在一个更简单,更清晰的分析方式。

英文摘要:

A recently proposed dimensional reduction approach for studying synchronization in the Kuramoto model is employed to build optimal network topologies to favor or to suppress synchronization. The approach is based in the introduction of a collective coordinate for the time evolution of the phase locked oscillators, in the spirit of the Ott-Antonsen ansatz. We show that the optimal synchronization of a Kuramoto network demands the maximization of the quadratic function $ω^T L ω$, where $ω$ stands for the vector of the natural frequencies of the oscillators, and $L$ for the network Laplacian matrix. Many recently obtained numerical results can be re-obtained analytically and in a simpler way from our maximization condition. A computationally efficient {hill climb} rewiring algorithm is proposed to generate networks with optimal synchronization properties. Our approach can be easily adapted to the case of the Kuramoto models with both attractive and repulsive interactions, and again many recent numerical results can be rederived in a simpler and clearer analytical manner.

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

↑