2009
DOI: 10.1142/s0218127409025079
|View full text |Cite
|
Sign up to set email alerts
|

The Existence and Classification of Synchrony-Breaking Bifurcations in Regular Homogeneous Networks Using Lattice Structures

Abstract: For regular homogeneous networks with simple eigenvalues (real or complex), all possible explicit forms of lattices of balanced equivalence relations can be constructed by introducing lattice generators and lattice indices [Kamei, 2009]. Balanced equivalence relations in the lattice correspond to clusters of partially synchronized cells in a network. In this paper, we restrict attention to regular homogeneous networks with simple real eigenvalues, and one-dimensional internal dynamics for each cell. We first s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 24 publications
0
13
0
Order By: Relevance
“…Such analysis has been used in systems biology (such as transcription or protein interaction networks) and has been applied to study the structure in neural systems (see for example [ 98 , 99 ]) and the implications of this for the dynamics. They have also been used to organise the analysis of the dynamics of small assemblies of coupled cells; see for example [ 100 , 101 ].…”
Section: Dynamical Systems Approaches To Collective Behaviourmentioning
confidence: 99%
See 1 more Smart Citation
“…Such analysis has been used in systems biology (such as transcription or protein interaction networks) and has been applied to study the structure in neural systems (see for example [ 98 , 99 ]) and the implications of this for the dynamics. They have also been used to organise the analysis of the dynamics of small assemblies of coupled cells; see for example [ 100 , 101 ].…”
Section: Dynamical Systems Approaches To Collective Behaviourmentioning
confidence: 99%
“…3.12 provides an interesting framework to discuss CPG dynamics in cases where the connection structure is given but not purely related to symmetries of the network. For example, [ 141 ] use that formalism to understand possible spatio-temporal patterns that arise in lattices or [ 100 ] that relates synchrony properties of small motif networks to spectral properties of the adjacency matrix.…”
Section: Applicationsmentioning
confidence: 99%
“…This model arises as a mathematical caricature of a model developed in [Krause et al, 2017] representing fluid and cell interactions in a bioactive porous medium. While lattice-dynamical systems have been studied in a variety of different settings [Buzano & Golubitsky, 1983;Winterbottom, 2004;Wang et al, 2006;Kamei, 2009;Sattinger, 1980], we note that processes defined on finite lattices are less well-studied, and have been shown to exhibit unique dynamics due to the influence of boundaries [Chow et al, 1996;Gillis & Golubitsky, 1997;Golubitsky et al, 2004]. Additionally, our model also exhibits nonlocal coupling across the lattice, which is also of interest from the dynamical systems perspective [Gourley et al, 2001;Billingham, 2004;Hamel & Ryzhik, 2014].…”
Section: Introductionmentioning
confidence: 94%
“…We denote the quotient network by N/ ⊲⊳. We also say that a network L is a lift of N, if N is a quotient of L with respect to some balanced coloring of L. ♦ The set of balanced colorings forms a complete lattice, see [14,8]. Denote by Λ N the set of balanced colorings for N. For every ⊲⊳ 1 , ⊲⊳ 2 ∈ Λ N , we say that ⊲⊳ 1 is a refinement of ⊲⊳ 2 , and we write ⊲⊳ 1 ≺⊲⊳ 2 , if ⊲⊳ 1 =⊲⊳ 2 and c ⊲⊳ 1 d implies c ⊲⊳ 2 d for every cells c, d of N. We denote by the relation of refinement or equal.…”
Section: See 1 For Two Examples Of Regular Network With Valencymentioning
confidence: 99%
“…Consider the network #29 of[8] (1a) which will be denoted by N 29 and has the adjacency matrixThe eigenvalues of A 29 are the network valency 2, −1 and 0 with multiplicity 1, 1 and 2, respectively, which are semisimple. The network N 29 has four nontrivial balanced colorings⊲⊳ 1 = {{1, 2}, {3, 4}}, ⊲⊳ 2 = {{1}, {2, 3, 4}}, ⊲⊳ 3 = {{1, 2}, {3}, {4}} and ⊲⊳ 4 = {{1}, {2}, {3, 4}}.The balanced coloring ⊲⊳ = is 0-submaximal of type 2 with 0-simple components ⊲⊳ 3 and ⊲⊳ 4 .…”
mentioning
confidence: 99%