Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T02:56:10.573Z Has data issue: false hasContentIssue false
  • English
  • Français

The lattice of balanced equivalence relations of a coupled cell network

Published online by Cambridge University Press:  01 July 2007

IAN STEWART
IAN STEWART*
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 143 , Issue 1 , July 2007 , pp. 165 - 183
Copyright
Copyright © Cambridge Philosophical Society 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Aldis, J.. A polynomial time algorithm to determine maximal balanced equivalence relations. Internat J. Bifur Chaos Appl. Sci. Engrg., to appear.Google Scholar
[2]Antoneli, F. and Stewart, I.. Symmetry and synchrony in coupled cell networks 2: group networks. Internat. J. Bifur Chaos Appl. Sci. Engrg., to appear.Google Scholar
[3]Davey, B. A. and Priestley, H. A.. Introduction to Lattices and Order (Cambridge University Press 1990).Google Scholar
[4]Fulton, W. and Harris, J.. Representation Theory. Graduate Texts in Math. 129 (Springer, 1991).Google Scholar
[5]Golubitsky, M. and Stewart, I.. Nonlinear dynamics of networks: the groupoid formalism. Bull. Amer. Math. Soc. 43 (2006), 305–364.CrossRefGoogle Scholar
[6]Golubitsky, M., Stewart, I. and Török, A.. Patterns of synchrony in coupled cell networks with multiple arrows. SIAM J. Appl. Dynam. Sys. 4 (1) (2005), 78–100.CrossRefGoogle Scholar
[7]Graham, R. L., Knuth, D. E. and Patashnik, O.. Concrete Mathematics (Addison-Wesley 1994).Google Scholar
[8]Higgins, P. J.. Notes on Categories and Groupoids. Van Nostrand Reinhold Mathematical Studies 32 (Van Nostrand Reinhold, 1971).Google Scholar
[9]Manrubia, S. C., Mikhailov, A. S. and Zanette, D. H.. Emergence of Dynamical Order (World Scientific 2004).CrossRefGoogle Scholar
[10]Mosekilde, E., Maistrenko, Y. and Postonov, D.. Chaotic Synchronization (World Scientific 2002).CrossRefGoogle Scholar
[11]Stewart, I., Golubitsky, M. and Pivato, M.. Patterns of synchrony in coupled cell networks. SIAM J. Appl. Dynam. Sys 2 (2003), 609–646. [DOI: 10.1137/S1111111103419896].CrossRefGoogle Scholar
[12]Wilson, R. J.. Introduction to Graph Theory (3rd ed.) (Longman 1985).Google Scholar
[13]Wu, C. W.. Synchronization in Coupled Chaotic Circuits and Systems (World Scientific 2002).CrossRefGoogle Scholar
[14]Wu, C. W.. Synchronization in networks of nonlinear dynamical systems coupled via a directed graph. Nonlinearity 18 (2005), 1057–1064.CrossRefGoogle Scholar