Simple heteroclinic networks in
arXiv:1802.05232 · doi:10.1088/1361-6544/ab1818
Abstract
We classify simple heteroclinic networks for a -equivariant system in with finite , proceeding as follows: we define a graph associated with a given and identify all so-called simple graphs associated with subgroups of . Then, knowing the graph associated with a given , we determine the types of heteroclinic networks that the group admits. Our study is restricted to networks that are maximal in the sense that they have the highest possible number of connections -- any non-maximal network can then be derived by deleting one or more connections. Finally, for networks of type A, i.e., admitted by , we give necessary and sufficient conditions for fragmentary and essential asymptotic stability. (For other simple heteroclinic networks the conditions for stability are known.) The results are illustrated by a numerical example of a simple heteroclinic network that involves two subcycles that can be essentially asymptotically stable simultaneously.
arXiv comment27 pages, 6 figures, submitted to Nonlinearity
References in corpus (7)
- Stability and bifurcations of heteroclinic cycles of type Z
- On local attraction properties and a stability index for heteroclinic connections
- Stability in simple heteroclinic networks in
- Switching in heteroclinic networks
- Heteroclinic cycles in Hopfield networks
- Construction of heteroclinic networks in
- Pseudo-simple heteroclinic cycles in