Abstract

A coupled cell network is a directed graph whose nodes represent dynamical systems and whose directed edges specify how those systems are coupled to each other. The typical dynamic behaviour of a network is strongly constrained by its topology. Especially important constraints arise from global (group) symmetries and local (groupoid) symmetries. The H/K theorem of Buono and Golubitsky characterises the possible spatio-temporal symmetries of time-periodic states of group-equivariant dynamical systems. A version of this theorem for group-symmetric networks has been proved by Josić and Török. In networks, spatial symmetries correspond to synchrony of cells, and spatio-temporal symmetries correspond to phase relations between cells. Associated with any coupled cell network is a canonical class of admissible ODEs that respect the network topology. A pattern of synchrony or phase relations in a hyperbolic time-periodic state of such an ODE is rigid if the pattern persists under small admissible perturbations. We characterise rigid patterns of synchrony and rigid phase patterns in coupled cell networks, on the assumption that the periodic state is fully oscillatory (no cell is in equilibrium) and the network has a basic property, the rigid phase property. We conjecture that all networks have the rigid phase property, and that in any path-connected network an admissible ODE with a hyperbolic periodic state can always be perturbed to make the perturbed periodic state fully oscillatory. Our main result states that in any path-connected network with the rigid phase property, every rigid pattern of phase relations can be characterised in two stages. First, sets of cells form synchronous clumps according to a balanced equivalence relation. Second, the corresponding quotient network has a cyclic group of automorphisms, and the phase relations are induced by associating a fixed phase shift with a generator of this group. Thus the clumps of synchronous cells form a discrete rotating wave. As a corollary, we prove an analogue of the H/K theorem for any path-connected network. We also discuss the non-path-connected case.

Full Text
Published version (Free)

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 call