Complete heteroclinic networks derived from graphs consisting of two cycles
Preprint
Abstract
We address the question how a given connection structure (directed graph) can be realised as a heteroclinic network that is complete in the sense that it contains all unstable manifolds of its equilibria. For a directed graph consisting of two cycles we provide a constructive method to achieve this: (i) enlarge the graph by adding some edges and (ii) apply the simplex method to obtain a network in phase space. Depending on the length of the cycles we derive the minimal number of required new edges. In the resulting network each added edge leads to a positive transverse eigenvalue at the respective equilibrium. We discuss the total number of such positive eigenvalues in an individual cycle and some implications for the stability of this cycle.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- A hybrid heteroclinic cycleExamples and Counterexamples, 2022
- Almost Complete and Equable Heteroclinic NetworksJournal of Nonlinear Science, 2019
- Heteroclinic Dynamics of Localized Frequency Synchrony: Stability of Heteroclinic Cycles and NetworksJournal of Nonlinear Science, 2019
- Stability of quasi-simple heteroclinic cyclesDynamical Systems, 2018
- Designing Heteroclinic and Excitable Networks in Phase Space Using Two Populations of Coupled CellsJournal of Nonlinear Science, 2015
- Heteroclinic Networks in Homogeneous and Heterogeneous Identical Cell SystemsJournal of Nonlinear Science, 2015
- On designing heteroclinic networks from graphsPhysica D: Nonlinear Phenomena, 2013
- On local attraction properties and a stability index for heteroclinic connectionsNonlinearity, 2011
- Heteroclinic Networks in Coupled Cell SystemsArchive for Rational Mechanics and Analysis, 1999
- Asymptotic stability of heteroclinic cycles in systems with symmetryErgodic Theory and Dynamical Systems, 1995