Location of Repository

The lattice of balanced equivalence relations of a coupled cell network

By Ian Stewart


A coupled cell system is a collection of dynamical systems, or ‘cells’, that are coupled together. The associated coupled cell network is a labelled directed graph that indicates how the cells are coupled, and which cells are equivalent. Golubitsky, Stewart, Pivato and Török have presented a framework for coupled cell systems that permits a classification of robust synchrony in terms of the concept of a ‘balanced equivalence relation’, which depends solely on the network architecture. In their approach the network is assumed to be finite. We prove that the set of all balanced equivalence relations on a network forms a lattice, in the sense of a partially ordered set in which any two elements have a meet and a join. The partial order is defined by refinement. Some aspects of the theory make use of infinite networks, so we work in the category of networks of ‘finite type’, a class that includes all locally finite networks. This context requires some modifications to the standard framework. As partial compensation, the lattice of balanced equivalence relations can then be proved complete. However, the intersection of two balanced equivalence relations need not be balanced, as we show by a simple example, so this lattice is not a sublattice of the lattice of all equivalence relations with its usual operations of meet and join. We discuss the structure of this lattice and computational issues associated with it. In particular, we describe how to determine whether the lattice contains more than the equality relation. As an example, we derive the form of the lattice for a linear chain of identical cells with feedback

Topics: QA
Publisher: Cambridge University Press
Year: 2007
OAI identifier: oai:wrap.warwick.ac.uk:651

Suggested articles



  1. A LDIS.Apolynomialtimealgorithmtodeterminemaximalbalancedequivalencerelations.Internat
  2. (2004). Emergence of Dynamical Order (World Scientific, doi
  3. (1990). Introduction to Lattices and Order doi
  4. Nonlinear dynamics of networks: the groupoid formalism. doi
  5. (2005). Patterns of synchrony in coupled cell networks with multiple arrows. doi
  6. (2003). Patterns of synchrony in coupled cell networks. doi
  7. (1991). Representation Theory. Graduate Texts in Math.
  8. Symmetry and synchrony in coupled cell networks 2: group networks. doi
  9. (2002). Synchronization in Coupled Chaotic Circuits and Systems (World Scientific, doi
  10. (2005). Synchronization in networks of nonlinear dynamical systems coupled via a directed graph. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.