平面上等频Kuramoto模型锁相的多重稳定性

R. Delabays, T. Coletta, P. Jacquod
{"title":"平面上等频Kuramoto模型锁相的多重稳定性","authors":"R. Delabays, T. Coletta, P. Jacquod","doi":"10.1063/1.4978697","DOIUrl":null,"url":null,"abstract":"The number $\\mathcal{N}$ of stable fixed points of locally coupled Kuramoto models depends on the topology of the network on which the model is defined. It has been shown that cycles in meshed networks play a crucial role in determining $\\mathcal{N}$, because any two different stable fixed points differ by a collection of loop flows on those cycles. Since the number of different loop flows increases with the length of the cycle that carries them, one expects $\\mathcal{N}$ to be larger in meshed networks with longer cycles. Simultaneously, the existence of more cycles in a network means more freedom to choose the location of loop flows differentiating between two stable fixed points. Therefore, $\\mathcal{N}$ should also be larger in networks with more cycles. We derive an algebraic upper bound for the number of stable fixed points of the Kuramoto model with identical frequencies, under the assumption that angle differences between connected nodes do not exceed $\\pi/2$. We obtain $\\mathcal{N}\\leq\\prod_{k=1}^c\\left[2\\cdot{\\rm Int}(n_k/4)+1\\right]$, which depends both on the number $c$ of cycles and on the spectrum of their lengths $\\{n_k\\}$. We further identify network topologies carrying stable fixed points with angle differences larger than $\\pi/2$, which leads us to conjecture an upper bound for the number of stable fixed points for Kuramoto models on any planar network. Compared to earlier approaches that give exponential upper bounds in the total number of vertices, our bounds are much lower and therefore much closer to the true number of stable fixed points.","PeriodicalId":139082,"journal":{"name":"arXiv: Adaptation and Self-Organizing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Multistability of Phase-Locking in Equal-Frequency Kuramoto Models on Planar Graphs\",\"authors\":\"R. Delabays, T. Coletta, P. Jacquod\",\"doi\":\"10.1063/1.4978697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The number $\\\\mathcal{N}$ of stable fixed points of locally coupled Kuramoto models depends on the topology of the network on which the model is defined. It has been shown that cycles in meshed networks play a crucial role in determining $\\\\mathcal{N}$, because any two different stable fixed points differ by a collection of loop flows on those cycles. Since the number of different loop flows increases with the length of the cycle that carries them, one expects $\\\\mathcal{N}$ to be larger in meshed networks with longer cycles. Simultaneously, the existence of more cycles in a network means more freedom to choose the location of loop flows differentiating between two stable fixed points. Therefore, $\\\\mathcal{N}$ should also be larger in networks with more cycles. We derive an algebraic upper bound for the number of stable fixed points of the Kuramoto model with identical frequencies, under the assumption that angle differences between connected nodes do not exceed $\\\\pi/2$. We obtain $\\\\mathcal{N}\\\\leq\\\\prod_{k=1}^c\\\\left[2\\\\cdot{\\\\rm Int}(n_k/4)+1\\\\right]$, which depends both on the number $c$ of cycles and on the spectrum of their lengths $\\\\{n_k\\\\}$. We further identify network topologies carrying stable fixed points with angle differences larger than $\\\\pi/2$, which leads us to conjecture an upper bound for the number of stable fixed points for Kuramoto models on any planar network. Compared to earlier approaches that give exponential upper bounds in the total number of vertices, our bounds are much lower and therefore much closer to the true number of stable fixed points.\",\"PeriodicalId\":139082,\"journal\":{\"name\":\"arXiv: Adaptation and Self-Organizing Systems\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Adaptation and Self-Organizing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1063/1.4978697\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Adaptation and Self-Organizing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1063/1.4978697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

局部耦合Kuramoto模型稳定不动点的个数$\mathcal{N}$取决于定义模型的网络的拓扑结构。已经证明,网状网络中的循环在确定$\mathcal{N}$中起着至关重要的作用,因为任何两个不同的稳定不动点都不同于这些循环上的环路流的集合。由于不同环路流的数量随着承载它们的循环的长度而增加,因此人们预计$\mathcal{N}$在具有较长周期的网状网络中会更大。同时,网络中环数越多,意味着在两个稳定不动点之间微分的环流位置选择的自由度越大。因此,在周期较多的网络中,$\mathcal{N}$也应该更大。在连接节点之间的角度差不超过$\pi/2$的假设下,我们导出了具有相同频率的Kuramoto模型的稳定不动点数目的代数上界。我们得到$\mathcal{N}\leq\prod_{k=1}^c\left[2\cdot{\rm Int}(n_k/4)+1\right]$,它既取决于周期数$c$,也取决于周期长度的谱$\{n_k\}$。我们进一步确定了带有角度差大于$\pi/2$的稳定不动点的网络拓扑,这使我们推测了任意平面网络上Kuramoto模型的稳定不动点数量的上界。与之前给出顶点总数指数上界的方法相比,我们的上界要低得多,因此更接近稳定不动点的真实数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multistability of Phase-Locking in Equal-Frequency Kuramoto Models on Planar Graphs
The number $\mathcal{N}$ of stable fixed points of locally coupled Kuramoto models depends on the topology of the network on which the model is defined. It has been shown that cycles in meshed networks play a crucial role in determining $\mathcal{N}$, because any two different stable fixed points differ by a collection of loop flows on those cycles. Since the number of different loop flows increases with the length of the cycle that carries them, one expects $\mathcal{N}$ to be larger in meshed networks with longer cycles. Simultaneously, the existence of more cycles in a network means more freedom to choose the location of loop flows differentiating between two stable fixed points. Therefore, $\mathcal{N}$ should also be larger in networks with more cycles. We derive an algebraic upper bound for the number of stable fixed points of the Kuramoto model with identical frequencies, under the assumption that angle differences between connected nodes do not exceed $\pi/2$. We obtain $\mathcal{N}\leq\prod_{k=1}^c\left[2\cdot{\rm Int}(n_k/4)+1\right]$, which depends both on the number $c$ of cycles and on the spectrum of their lengths $\{n_k\}$. We further identify network topologies carrying stable fixed points with angle differences larger than $\pi/2$, which leads us to conjecture an upper bound for the number of stable fixed points for Kuramoto models on any planar network. Compared to earlier approaches that give exponential upper bounds in the total number of vertices, our bounds are much lower and therefore much closer to the true number of stable fixed points.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reviving a failed network via microscopic interventions Instantaneous phase synchronization of two decoupled quantum limit-cycle oscillators induced by conditional photon detection Non-normality and non-monotonic dynamics in complex reaction networks Spontaneous Organizations of Diverse Network Structures in Coupled Logistic Maps with a Delayed Connection Change Dynamic stability of complex networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1