{"publisher":"Society for Industrial & Applied Mathematics (SIAM)","type":"journal_article","keyword":["Applied Mathematics"],"citation":{"short":"S. von der Gracht, E. Nijholt, B. Rink, SIAM Journal on Applied Mathematics 83 (2023) 2329–2353.","bibtex":"@article{von der Gracht_Nijholt_Rink_2023, title={Hypernetworks: Cluster Synchronization Is a Higher-Order Effect}, volume={83}, DOI={<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>}, number={6}, journal={SIAM Journal on Applied Mathematics}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}, year={2023}, pages={2329–2353} }","ieee":"S. von der Gracht, E. Nijholt, and B. Rink, “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect,” <i>SIAM Journal on Applied Mathematics</i>, vol. 83, no. 6, pp. 2329–2353, 2023, doi: <a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>.","ama":"von der Gracht S, Nijholt E, Rink B. Hypernetworks: Cluster Synchronization Is a Higher-Order Effect. <i>SIAM Journal on Applied Mathematics</i>. 2023;83(6):2329-2353. doi:<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>","mla":"von der Gracht, Sören, et al. “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect.” <i>SIAM Journal on Applied Mathematics</i>, vol. 83, no. 6, Society for Industrial &#38; Applied Mathematics (SIAM), 2023, pp. 2329–53, doi:<a href=\"https://doi.org/10.1137/23m1561075\">10.1137/23m1561075</a>.","chicago":"Gracht, Sören von der, Eddie Nijholt, and Bob Rink. “Hypernetworks: Cluster Synchronization Is a Higher-Order Effect.” <i>SIAM Journal on Applied Mathematics</i> 83, no. 6 (2023): 2329–53. <a href=\"https://doi.org/10.1137/23m1561075\">https://doi.org/10.1137/23m1561075</a>.","apa":"von der Gracht, S., Nijholt, E., &#38; Rink, B. (2023). Hypernetworks: Cluster Synchronization Is a Higher-Order Effect. <i>SIAM Journal on Applied Mathematics</i>, <i>83</i>(6), 2329–2353. <a href=\"https://doi.org/10.1137/23m1561075\">https://doi.org/10.1137/23m1561075</a>"},"_id":"49326","status":"public","year":"2023","user_id":"97359","publication":"SIAM Journal on Applied Mathematics","language":[{"iso":"eng"}],"page":"2329-2353","volume":83,"department":[{"_id":"101"}],"doi":"10.1137/23m1561075","date_created":"2023-11-29T10:50:05Z","publication_status":"published","external_id":{"arxiv":["2302.08974"]},"author":[{"last_name":"von der Gracht","full_name":"von der Gracht, Sören","id":"97359","first_name":"Sören","orcid":"0000-0002-8054-2058"},{"last_name":"Nijholt","full_name":"Nijholt, Eddie","first_name":"Eddie"},{"full_name":"Rink, Bob","last_name":"Rink","first_name":"Bob"}],"publication_identifier":{"issn":["0036-1399","1095-712X"]},"title":"Hypernetworks: Cluster Synchronization Is a Higher-Order Effect","abstract":[{"lang":"eng","text":"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."}],"intvolume":"        83","issue":"6","date_updated":"2023-11-29T10:52:23Z"}