Abstract
In network dynamics, synchrony between nodes defines an equivalence relation, usually represented as a colouring. If the colouring is balanced, meaning that nodes of the same colour have colour-isomorphic inputs, it determines a subspace that is flow-invariant for any ODE compatible with the network structure. Therefore any state lying in such a subspace has the synchrony pattern determined by that balanced colouring. In 2005 Golubitsky and coworkers proved a strong converse for synchronous equilibria: every rigid synchrony colouring for a hyperbolic equilibrium is balanced, where rigidity means that the pattern persists under small admissible perturbations. We give a different proof of this theorem, based on overdetermined constraint equations, Sard’s Theorem, bump functions, and groupoid symmetrisation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
