On designing heteroclinic networks from graphs

Abstract

Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined to a large extent by the constraints and dimension of the system. As these networks are of great interest as dynamical models of biological and cognitive processes, it is useful to understand how particular graphs can be realised as robust heteroclinic networks that are attracting. This paper presents two methods of realizing arbitrarily complex directed graphs as robust heteroclinic networks for flows generated by ODEs---we say the ODEs {\em realise} the graphs as heteroclinic networks between equilibria that represent the vertices. Suppose we have a directed graph on $n_v$ vertices with $n_e$ edges. The "simplex realisation" embeds the graph as an invariant set of a flow on an $(n_v-1)$-simplex. This method realises the graph as long as it is one- and two-cycle free. The "cylinder realisation" embeds a graph as an invariant set of a flow on a $(n_e+1)$-dimensional space. This method realises the graph as long as it is one-cycle free. In both cases we find the graph as an invariant set within an attractor, and discuss some illustrative examples, including the influence of noise and parameters on the dynamics. In particular we show that the resulting heteroclinic network may or may not display "memory" of the vertices visited.

31 pages, 16 figures

References in corpus (3)

• Heteroclinic Ratchets in a System of Four Coupled Oscillators
• Controlled Perturbation-Induced Switching in Pulse-Coupled Oscillator Networks
• Resonance bifurcations of robust heteroclinic networks

Cited by in corpus (20)

• Mathematical frameworks for oscillatory network dynamics in neuroscience
• Heteroclinic switching between chimeras
• Interpreting recurrent neural networks behaviour via excitable network attractors
• Ghost channels and ghost cycles guiding long transients in dynamical systems
• Designing heteroclinic and excitable networks in phase space using two populations of coupled cells
• Memory selection and information switching in oscillator networks with higher-order interactions
• Two dimensional heteroclinic attractor in the generalized Lotka-Volterra system
• Quantifying noisy attractors: from heteroclinic to excitable networks
• Almost complete and equable heteroclinic networks
• Switching in heteroclinic networks
• A hierarchical heteroclinic network: Controlling the time evolution along its paths
• Asymptotic stability of robust heteroclinic networks
• Construction of heteroclinic networks in ${\mathbb{R}}^4$
• Heteroclinic Dynamics in Network Dynamical Systems with Higher-Order Interactions
• Networks with asymmetric inputs: lattice of synchrony subspaces
• Quasi-periodic perturbations of heteroclinic attractor networks
• Stochastic facilitation in heteroclinic communication channels
• Stability of a heteroclinic network and its cycles: a case study from Boussinesq convection
• Analysis of dynamics near heteroclinic networks in ${\mathbb{R}}^4$ with a projected map
• Robust heteroclinic cycles in pluridimensions