{"title":"Groupoids, Fibrations, and Balanced Colorings of Networks","authors":"Ian Stewart","doi":"10.1142/s0218127424300143","DOIUrl":null,"url":null,"abstract":"Robust synchrony in network dynamics is governed by balanced colorings and the corresponding quotient network, also formalized in terms of graph fibrations. Dynamics and bifurcations are constrained — often in surprising ways — by the associated synchrony subspaces, which are invariant under all admissible ordinary differential equations (ODEs). The class of admissible ODEs is determined by a groupoid, whose objects are the input sets of nodes and whose morphisms are input isomorphisms between those sets. We define the coloring subgroupoid corresponding to a coloring, leading to groupoid interpretations of colorings and quotient networks. The first half of the paper is mainly tutorial. The second half, which is new, characterizes the structure of the network groupoid and proves that the groupoid of the quotient network is the quotient of the network groupoid by a normal subgroupoid of transition elements.","PeriodicalId":506426,"journal":{"name":"International Journal of Bifurcation and Chaos","volume":"76 1‐2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Bifurcation and Chaos","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0218127424300143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Robust synchrony in network dynamics is governed by balanced colorings and the corresponding quotient network, also formalized in terms of graph fibrations. Dynamics and bifurcations are constrained — often in surprising ways — by the associated synchrony subspaces, which are invariant under all admissible ordinary differential equations (ODEs). The class of admissible ODEs is determined by a groupoid, whose objects are the input sets of nodes and whose morphisms are input isomorphisms between those sets. We define the coloring subgroupoid corresponding to a coloring, leading to groupoid interpretations of colorings and quotient networks. The first half of the paper is mainly tutorial. The second half, which is new, characterizes the structure of the network groupoid and proves that the groupoid of the quotient network is the quotient of the network groupoid by a normal subgroupoid of transition elements.