{"title":"Hypernetworks: Cluster Synchronization Is a Higher-Order Effect","authors":"Sören von der Gracht, Eddie Nijholt, Bob Rink","doi":"10.1137/23m1561075","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Applied Mathematics, Volume 83, Issue 6, Page 2329-2353, December 2023. <br/> Abstract. Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by defining a class of admissible maps for every such hypernetwork. We explain how to classify robust cluster synchronization patterns on hypernetworks by finding balanced partitions, and we generalize the concept of a graph fibration to the hypernetwork context. We also show that robust synchronization patterns are only fully determined by polynomial admissible maps of high order. This means that, unlike in dyadic networks, cluster synchronization on hypernetworks is a higher-order, i.e., nonlinear, effect. We give a formula, in terms of the order of the hypernetwork, for the degree of the polynomial admissible maps that determine robust synchronization patterns. We also demonstrate that this degree is optimal by investigating a class of examples. We conclude by demonstrating how this effect may cause remarkable synchrony breaking bifurcations that occur at high polynomial degree.","PeriodicalId":51149,"journal":{"name":"SIAM Journal on Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2023-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1561075","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 3
Abstract
SIAM Journal on Applied Mathematics, Volume 83, Issue 6, Page 2329-2353, December 2023. Abstract. Many networked systems are governed by non-pairwise interactions between nodes. The resulting higher-order interaction structure can then be encoded by means of a hypernetwork. In this paper we consider dynamical systems on hypernetworks by defining a class of admissible maps for every such hypernetwork. We explain how to classify robust cluster synchronization patterns on hypernetworks by finding balanced partitions, and we generalize the concept of a graph fibration to the hypernetwork context. We also show that robust synchronization patterns are only fully determined by polynomial admissible maps of high order. This means that, unlike in dyadic networks, cluster synchronization on hypernetworks is a higher-order, i.e., nonlinear, effect. We give a formula, in terms of the order of the hypernetwork, for the degree of the polynomial admissible maps that determine robust synchronization patterns. We also demonstrate that this degree is optimal by investigating a class of examples. We conclude by demonstrating how this effect may cause remarkable synchrony breaking bifurcations that occur at high polynomial degree.
期刊介绍:
SIAM Journal on Applied Mathematics (SIAP) is an interdisciplinary journal containing research articles that treat scientific problems using methods that are of mathematical interest. Appropriate subject areas include the physical, engineering, financial, and life sciences. Examples are problems in fluid mechanics, including reaction-diffusion problems, sedimentation, combustion, and transport theory; solid mechanics; elasticity; electromagnetic theory and optics; materials science; mathematical biology, including population dynamics, biomechanics, and physiology; linear and nonlinear wave propagation, including scattering theory and wave propagation in random media; inverse problems; nonlinear dynamics; and stochastic processes, including queueing theory. Mathematical techniques of interest include asymptotic methods, bifurcation theory, dynamical systems theory, complex network theory, computational methods, and probabilistic and statistical methods.