Traditionally, interaction systems have been described as networks, where links encode information on the pairwise influences among the nodes. Yet, in many systems, interactions take place in larger groups. Recent work has shown that higher-order interactions between oscillators can significantly affect synchronization. However, these early studies have mostly considered interactions up to 4 oscillators at time, and analytical treatments are limited to the all-to-all setting. Here, we propose a general framework that allows us to effectively study populations of oscillators where higher-order interactions of all possible orders are considered, for any complex topology described by arbitrary hypergraphs, and for general coupling functions. To this scope, we introduce a multi-order Laplacian whose spectrum determines the stability of the synchronized solution. Our framework is validated on three structures of interactions of increasing complexity. First, we study a population with all-to-all interactions at all orders, for which we can derive in a full analytical manner the Lyapunov exponents of the system, and for which we investigate the effect of including attractive and repulsive interactions. Second, we apply the multi-order Laplacian framework to synchronization on a synthetic model with heterogeneous higher-order interactions. Finally, we compare the dynamics of coupled oscillators with higher-order and pairwise couplings only, for a real dataset describing the macaque brain connectome, highlighting the importance of faithfully representing the complexity of interactions in real-world systems. Taken together, our multi-order Laplacian allows us to obtain a complete analytical characterization of the stability of synchrony in arbitrary higher-order networks, paving the way towards a general treatment of dynamical processes beyond pairwise interactions.
Hodge Decomposition Guides the Optimization of Synchronization over Simplicial Complexes
Department of Mathematics, SUNY Buffalo(纽约州立大学布法罗分校数学系);Department of Mathematics, Trinity College(三一学院数学系);School of Computing and Department of Mathematics & Statistics, University of Wyoming(怀俄明大学计算学院及数学与统计系)
Optimal synchronization of Kuramoto oscillators: a dimensional reduction approach
最近提出的降维方法研究同步在仓本模型中建立最佳的网络拓扑结构,以促进或抑制同步。该方法的基础是在一个集体坐标的锁相振荡器的时间演化的介绍,在的精神,安东森anquiry。我们证明了仓本网络的最优同步要求二次函数$ω^T L ω$的最大化,其中$ω$代表振荡器的固有频率的向量,和$L$网络的拉普拉斯矩阵。许多最近得到的数值结果可以重新获得解析和更简单的方式从我们的最大化条件。提出了一种计算效率高的{爬山}重布线算法来生成具有最佳同步特性的网络。我们的方法可以很容易地适应的情况下,仓本模型的吸引力和排斥力的相互作用,并再次许多最近的数值结果可以重新推导在一个更简单,更清晰的分析方式。
Cycle holonomy captures higher-order compatibility constraints in remote synchronization
Universitat Rovira i Virgili(罗维拉-维尔吉利大学);Center for Computational Science and Applied Mathematics (ComSCIAM), Universitat Rovira i Virgili(罗维拉-维尔吉利大学计算科学与应用数学中心)
Synchronization of higher-dimensional Kuramoto oscillators on networks: from scalar to matrix-weighted couplings
Centro Studi e Ricerche ‘Enrico Fermi’ (CREF)(恩里科·费米中心研究与研究所);IMT School for Advanced Studies(IMT高等研究院);Institute for Applied Computing ‘Mauro Picone’ (IAC), National Research Council(国家研究委员会 Mauro Picone 应用计算研究所);Mathematical Institute, University of Oxford(牛津大学数学研究所);Department of mathematics and Namur Institute for Complex Systems, naXys University of Namur(那慕尔大学 naXys 系与那慕尔复杂系统研究所)