Computation of Balanced Equivalence Relations and their Lattice for a Coupled Cell Network

Abstract

A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in different ways, which can be represented graphically by different symbols, or abstractly by equivalence relations. Various synchronous behaviors, from full synchrony to partial synchrony, can be observed for a given network. Patterns of synchrony, which do not depend on specific dynamics of the network, but only on the network structure, are associated with a special type of partition of cells, termed balanced equivalence relations. Algorithms in Aldis (2008) and Belykh and Hasler (2011) find the unique pattern of synchrony with the least clusters. In this paper, we compute the set of all possible patterns of synchrony and show their hierarchy structure as a complete lattice. We represent the network structure of a given coupled cell network by a symbolic adjacency matrix encoding the different coupling types. We show that balanced equivalence relations can be determined by a matrix computation on the adjacency matrix which forms a block structure for each balanced equivalence relation. This leads to a computer algorithm to search for all possible balanced equivalence relations. Our computer program outputs the balanced equivalence relations, quotient matrices, and a complete lattice for user specified coupled cell networks. Finding the balanced equivalence relations of any network of up to 15 nodes is tractable, but for larger networks this depends on the pattern of synchrony with least clusters.

31 pages. Accepted for publication at SIAM Journal on Applied Dynamical Systems (SIADS), preprint submitted to arXiv with SIAM's permission. For supplementary material, see https://github.com/peterjc/ccn

References in corpus (1)

• Synchronization in complex networks

Cited by in corpus (8)

• Fibration symmetries uncover the building blocks of biological networks
• One-way dependent clusters and stability of cluster synchronization in directed networks
• Matryoshka and Disjoint Cluster Synchronization of Networks
• Collective dynamics on higher-order networks
• Predicting synchronized gene coexpression patterns from fibration symmetries in gene regulatory networks in bacteria
• Symmetry-driven network reconstruction through pseudobalanced coloring optimization
• Fast algorithm to identify cluster synchrony through fibration symmetries in large information-processing networks
• A Bifurcation Lemma for Invariant Subspaces