Abstract
We define a graph network to be a coupled cell network where there are only one type of cell and one type of symmetric coupling between the cells. For a difference-coupled vector field on a graph network system, all the cells have the same internal dynamics, and the coupling between cells is identical, is symmetric, and depends only on the difference of the states of the interacting cells. We define four nested sets of difference-coupled vector fields by adding further restrictions on the internal dynamics and the coupling functions. These restrictions require that these functions preserve zero or are odd or linear. We characterize the synchrony and antisynchrony subspaces with respect to these four subsets of admissible vector fields. Synchrony and antisynchrony subspaces are determined by partitions and matched partitions of the cells that satisfy certain balance conditions. We compute the lattice of synchrony and antisynchrony subspaces for some examples of graph networks. We also apply our theory to systems of coupled van der Pol oscillators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.