Skip to main content
Log in

Almost Complete and Equable Heteroclinic Networks

  • Published:
Journal of Nonlinear Science Aims and scope Submit manuscript

Abstract

Heteroclinic connections are trajectories that link invariant sets for an autonomous dynamical flow: these connections can robustly form networks between equilibria, for systems with flow-invariant spaces. In this paper, we examine the relation between the heteroclinic network as a flow-invariant set and directed graphs of possible connections between nodes. We consider realizations of a large class of transitive digraphs as robust heteroclinic networks and show that although robust realizations are typically not complete (i.e. not all unstable manifolds of nodes are part of the network), they can be almost complete (i.e. complete up to a set of zero measure within the unstable manifold) and equable (i.e. all sets of connections from a node have the same dimension). We show there are almost complete and equable realizations that can be closed by adding a number of extra nodes and connections. We discuss some examples and describe a sense in which an equable almost complete network embedding is an optimal description of stochastically perturbed motion on the network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. In equivariant systems, if \(\xi _i\ne \xi _j\) but they are in the same group orbit, then some authors consider the connection homoclinic. We do not make this distinction until Sect. 4.

  2. More general heteroclinic networks, in the sense of Ashwin and Field (1999), can have higher depth connections in that they can contain trajectories that limit to connections.

  3. There are several good references for graph theory, we refer the reader to, for example, Diestel (2005), Foulds (1992).

  4. Cycles are defined as simple in Krupa and Melbourne (2004) if the nodes are in different connected components of one-dimensional fixed-point spaces and the connections are in two-dimensional fixed-point spaces.

  5. When a connection \([\xi _i \rightarrow \xi _j]\) exists, the connection \([\xi _i \rightarrow -\xi _j]\) also exists. However, under the identification of objects in the same group orbit, only \(\xi _2\) is a splitting node.

References

Download references

Acknowledgements

We thank Chris Bick, Mike Field and Claire Postlethwaite for their insightful questions and comments. The second author was partly supported by CMUP (UID/MAT/00144/2013), funded by the Portuguese Government through the Fundação para a Ciência e a Tecnologia (FCT) with national (MEC) and European structural funds through the programs FEDER, under the partnership agreement PT2020. The second and third authors benefited from DAAD-CRUP funding through “Ação Integrada Luso-Alemã A10/17”, respectively, DAAD-project 57338573 PPP Portugal 2017, sponsored by the Federal Ministry of Education and Research (BMBF). Partial support for a visit to Exeter is gratefully acknowledged from the Centre for Predictive Modelling in Healthcare (EPSRC Grant No. EP/N014391/1).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Lohse.

Additional information

Communicated by Dr. Anthony Bloch.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ashwin, P., Castro, S.B.S.D. & Lohse, A. Almost Complete and Equable Heteroclinic Networks. J Nonlinear Sci 30, 1–22 (2020). https://doi.org/10.1007/s00332-019-09566-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00332-019-09566-z

Keywords

Mathematics Subject Classification

Navigation