CONSTRUCTION OF LATTICES OF BALANCED EQUIVALENCE RELATIONS FOR REGULAR HOMOGENEOUS NETWORKS USING LATTICE GENERATORS AND LATTICE INDICES

被引:9
|
作者
Kamei, Hiroko [1 ,2 ]
机构
[1] Univ Warwick, MOAC Doctoral Training Ctr, Coventry CV4 7AL, W Midlands, England
[2] Univ Dundee, Div Math, Dundee DD1 4HN, Scotland
来源
基金
英国工程与自然科学研究理事会;
关键词
Coupled cell networks; lattice; balanced equivalence relations; COUPLED CELL NETWORKS; COMPLEX NETWORKS; SYNCHRONIZATION; DYNAMICS; GRAPH; OSCILLATORS; PATTERNS; SYSTEMS;
D O I
10.1142/S0218127409025067
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:3691 / 3705
页数:15
相关论文
共 8 条