CONSTRUCTION OF LATTICES OF BALANCED EQUIVALENCE RELATIONS FOR REGULAR HOMOGENEOUS NETWORKS USING LATTICE GENERATORS AND LATTICE INDICES
Abstract
Regular homogeneous networks are a class of coupled cell network, which comprises one type of cell (node) with one type of coupling (arrow), and each cell has the same number of input arrows (called the valency of the network). In coupled cell networks, robust synchrony (a flow-invariant polydiagonal) corresponds to a special kind of partition of cells, called a balanced equivalence relation. Balanced equivalence relations are determined solely by the network structure. It is well known that the set of balanced equivalence relations on a given finite network forms a complete lattice. In this paper, we consider regular homogeneous networks in which the internal dynamics of each cell is one-dimensional, and whose associated adjacency matrices have simple eigenvalues (real or complex). We construct explicit forms of lattices of balanced equivalence relations for such networks by introducing key building blocks, called lattice generators, along with integer numbers called lattice indices. The properties of lattice indices allow construction of all possible lattice structures for balanced equivalence relations of regular homogeneous networks of any number of cells with any valency. As an illustration, we show all 14 possible lattice structures of balanced equivalence relations for four-cell regular homogeneous networks.
References
- Rev. Mod. Phys. 74, 47 (2002), DOI: 10.1103/RevModPhys.74.47. Crossref, ISI, Google Scholar
- Int. J. Bifurcation and Chaos 18, 407 (2008). Link, ISI, Google Scholar
- Physica D 237, 454 (2008), DOI: 10.1016/j.physd.2007.09.015. Crossref, ISI, Google Scholar
- Int. J. Bifurcation and Chaos 17, 3387 (2007). Link, ISI, Google Scholar
- Phys. Rep. 424, 175 (2002), DOI: 10.1016/j.physrep.2005.10.009. Crossref, ISI, Google Scholar
- Int. J. Bifurcation and Chaos 17, 2201 (2007). Link, ISI, Google Scholar
-
B. A. Davey and H. A. Priestley , Introduction to Lattices and Order ( Cambridge University Press , Cambridge , 1990 ) . Google Scholar - Bull. Amer. Math. Soc. 43, 305 (2006), DOI: 10.1090/S0273-0979-06-01108-6. Crossref, ISI, Google Scholar
- SIAM J. Appl. Dyn. Syst. 4, 78 (2005), DOI: 10.1137/040612634. Crossref, ISI, Google Scholar
- Int. J. Bifurcation and Chaos 19, 3707 (2009). Link, ISI, Google Scholar
- J. Math. Biol. 55, 61 (2007), DOI: 10.1007/s00285-007-0099-1. Crossref, ISI, Google Scholar
- SIAM J. Appl. Dyn. Syst. 2, 609 (2003), DOI: 10.1137/S1111111103419896. Crossref, ISI, Google Scholar
- Math. Proc. Camb. Phil. Soc. 143, 165 (2007), DOI: 10.1017/S0305004107000345. Crossref, ISI, Google Scholar
- Physica D 143, 1 (2000), DOI: 10.1016/S0167-2789(00)00094-4. Crossref, ISI, Google Scholar
- Nature 410, 268 (2001), DOI: 10.1038/35065725. Crossref, ISI, Google Scholar
- , Graph Theory, Encyclopaedia of Mathematics and Its Applications 21 , ed.
G.-C. Rota ( Addison-Wesley , Menlo Park , 1984 ) . Google Scholar - Int. J. Bifurcation and Chaos 12, 885 (2002). Link, ISI, Google Scholar
-
R. Wilson , Introduction to Graph Theory , 3rd edn. ( Longman , Harlow , 1985 ) . Google Scholar - Nonlinearity 18, 1057 (2005), DOI: 10.1088/0951-7715/18/3/007. Crossref, ISI, Google Scholar
| Remember to check out the Most Cited Articles! |
|---|
|
Check out our Bifurcation & Chaos |
