This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Stability of heteroclinic cycles in rings of coupled oscillators

Claire M. Postlethwaite Department of Mathematics, University of Auckland    Rob Sturman School of Mathematics, University of Leeds
Abstract

Networks of interacting nodes connected by edges arise in almost every branch of scientific enquiry. The connectivity structure of the network can force the existence of invariant subspaces, which would not arise in generic dynamical systems. These invariant subspaces can result in the appearance of robust heteroclinic cycles, which would otherwise be structurally unstable. Typically, the dynamics near a stable heteroclinic cycle is non-ergodic: mean residence times near the fixed points in the cycle are undefined, and there is a persistent slowing down. In this paper, we examine ring networks with nearest-neighbour or nearest-mm-neighbour coupling, and show that there exist classes of heteroclinic cycles in the phase space of the dynamics. We show that there is always at least one heteroclinic cycle which can be asymptotically stable, and thus the attracting dynamics of the network are expected to be non-ergodic. We conjecture that much of this behaviour persists in less structured networks and as such, non-ergodic behaviour is somehow typical.

pacs:

I Introduction

From the coupled map lattices proposed in the 1980s to the modern discipline of complex networks the study of simple systems connected in some way forms a fundamental paradigm in dynamical systems. Applications are plentiful and diverse, and include spatially extended systems, chemical reactions, biological and ecological networks, and span many length scales[1]. In many cases, a goal of study is spatiotemporal chaos[2], and this might typically mean computing a long-term average (for example, a Lyapunov exponent). However, it is well-known that a class of networks — those with invariant subspaces forced by symmetries in the system — permit heteroclinic cycles[3], that is, trajectories along which time averages do not converge, instead slowing down as they repeatedly and systematically get closer and closer to fixed points. We investigate a family of coupled map lattices defined on ring networks and establish stability properties of the many possible families of heteroclinic cycles.

Specifically, we consider how the structure of the architecture, or topology, of the network of physical nodes determines the architecture of a heteroclinic network in phase space between fixed points. We note that this question was asked in the reverse by Ashwin and Postlethwaite [4], who showed how to construct a system of ordinary differential equations into which was embedded a heteroclinic network of any specified topology.

In particular, we consider systems of the form

xi+1(k)=f(xi(k))eγk^Ak^kxi(k^),k=1,,N,x_{i+1}^{(k)}=f(x_{i}^{(k)})e^{-\gamma\sum_{\hat{k}}A_{\hat{k}k}x_{i}^{(\hat{k})}},\quad k=1,\dots,N, (1)

where γ0\gamma\leq 0 is a parameter. Each of the xi(k)[0,1]x_{i}^{(k)}\in[0,1] measures the activity at time ii of the kkth ‘node’ in a network, and Ak^kA_{\hat{k}k} is an adjacency matrix which determines the connectivity between the different nodes. We take the function ff to be the logistic map

f(x)=rx(1x)f(x)=rx(1-x)

where r(0,4]r\in(0,4] is a parameter. The dynamics of the uncoupled system with γ=0\gamma=0 is well known [5], but briefly, for r(0,1]r\in(0,1], the origin is an asymptotically stable fixed point. At r=1r=1 there is a transcritical bifurcation creating a second fixed point at x=r1rx=\frac{r-1}{r}. This fixed point is asymptotically stable for r(1,3]r\in(1,3], and at r=3r=3 undergoes a period-doubling bifurcation which leads to a period-doubling cascade followed by the onset of chaos at r3.56995r\approx 3.56995.

When x(k^)x^{(\hat{k})} is non-zero for some k^\hat{k}, then the term eγk^Ak^kx(k^)e^{-\gamma\sum_{\hat{k}}A_{\hat{k}k}x^{(\hat{k})}} in (1), with γ>0\gamma>0, has an inhibitory effect upon any node connected to k^\hat{k}, i.e. those for which Ak^k=1A_{\hat{k}k}=1. Specifically, if γx(k^)\gamma x^{(\hat{k})} is large enough, then this term can have the same effect as reducing the value of rr in the x(k)x^{(k)} equation to less than 1, and hence causing the values of those x(k)x^{(k)} to decrease towards zero. Heuristically, it is then clear that oscillatory behaviour is possible, as nodes can alternately be active (have a non-zero value), and hence inhibit those nodes they are connected to; decay, when other nodes in turn inhibit them; and finally grow again to an active state as the nodes inhibiting them decay in turn.

In figure 1 we show a time series from a cycle of three such coupled nodes, specifically, the set of equations

xi+1(1)\displaystyle x_{i+1}^{(1)} =f(xi(1))eγxi(3),\displaystyle=f(x_{i}^{(1)})e^{-\gamma x_{i}^{(3)}},
xi+1(2)\displaystyle x_{i+1}^{(2)} =f(xi(2))eγxi(1),\displaystyle=f(x_{i}^{(2)})e^{-\gamma x_{i}^{(1)}}, (2)
xi+1(3)\displaystyle x_{i+1}^{(3)} =f(xi(3))eγxi(2).\displaystyle=f(x_{i}^{(3)})e^{-\gamma x_{i}^{(2)}}.

In panel (a), we use r=2r=2, so the dynamics of the uncoupled system contains a stable fixed point. The time series clearly shows the trajectory cycling between three fixed points, in a manner essentially identical to that seen in the well-known Guckenheimer–Holmes heteroclinic cycle[3]. In panel (b), we use r=3.5r=3.5, so the uncoupled system is in the chaotic regime, and we see cycling between three chaotic attractors. This phenomena was previously described by Ashwin, Rucklidge and Sturman [6, 7].

Refer to captionRefer to caption

x(k)x^{(k)}

x(k)x^{(k)}

iiii(a)(b)
Figure 1: The figures show time series for equations 2, where components x(1)x^{(1)}, x(2)x^{(2)} and x(3)x^{(3)} are shown by the blue, red and yellow lines respectively. In panel (a), r=2r=2, γ=3.5\gamma=3.5; in panel (b), r=3.5r=3.5, γ=3.5\gamma=3.5.

In this paper, we extend the work of Ashwin et al. [6, 7] and consider larger networks of coupled systems in the form of (1). We refer these equations as describing the network of connections between nodes in physical space, and for the remainder of the paper, refer to this network as instead a directed graph with directed edges between nodes. We begin in section II, by considering another example: a five-node ring graph with one-way nearest-neighbour coupling. We determine the fixed points and the heteroclinic connections which exist between them. We refer to this network of connection as the phase space network, or heteroclinic network, which has heteroclinic connections (or sometimess simply connections) between fixed points. In section III, we consider general systems of the form of (1) and describe how to find the fixed points and heteroclinic connections for such a system. In general, this procedure results in a very complex heteroclinic network that is difficult to analyse, so in section IV we look in detail at NN-node directed graphs with one-way nearest neighbour coupling in the physical space. Here, as well as determining the structure of the heteroclinic network in phase space, we are able to analyse the dynamic stability of subcycles within the network. We use results from Podvigina [8], and some classical results on solutions to polynomials [9, 10] to prove theorem 1, which shows that only one of the subcycles can ever be stable, and then, only if γ\gamma is large enough. In section V we make some conjectures about larger networks. Section VI concludes.

II Example: five node ring graph with nearest-neighbour coupling

Refer to captionRefer to captionξ1\xi_{1}ξ3\xi_{3}ξ4\xi_{4}ξ5\xi_{5}ξ2\xi_{2}ξ1,4\xi_{1,4}ξ3,5\xi_{3,5}ξ2,4\xi_{2,4}ξ2,5\xi_{2,5}ξ1,3\xi_{1,3}(a)(b)
Figure 2: Panel (a) shows the physical network described by equations (9), with N=5N=5. Here, the physical nodes are shown by circles, and the inhibitory couplings by flat-ended arrows. Panel (b) shows the corresponding heteroclinic network. The dots represent fixed point solutions of the system (9), and arrows indicate the presence of a heteroclinic connection. In this figure and those that follow, note the distinction between circles for the nodes of the physical network, and filled dots for the fixed points of the heteroclinic network in phase space.

We give, in this section, an example of a five node directed graph with one-way nearest-neighbour coupling. We determine the possible fixed points in phase space, and the heteroclinic connections between them. We show time series of typical trajectories close to the resulting heteroclinic network but defer the computation of the stability of each of the sub-cycles to section IV.

We begin with a few formal definitions. Consider the map

xi+1=g(xi),xin,ix_{i+1}=g(x_{i}),\quad x_{i}\in\mathbb{R}^{n},\quad i\in\mathbb{Z} (3)

with fixed points ζ1,,ζM\zeta_{1},\dots,\zeta_{M}. A heteroclinic connection between ζj\zeta_{j} and ζj\zeta_{j^{\prime}} is a solution to (3) for which xiζjx_{i}\rightarrow\zeta_{j} as ii\rightarrow-\infty and xiζjx_{i}\rightarrow\zeta_{j^{\prime}} as ii\rightarrow\infty. Suppose that there exist heteroclinic connections between ζjk\zeta_{j_{k}} and ζjk+1\zeta_{j_{k+1}} for k=1,,M1k=1,\dots,M-1, and also one between ζjM\zeta_{j_{M}} and ζj1\zeta_{j_{1}}. Then the set HH consisting of the fixed points ζj\zeta_{j} and the connecting orbits is a heteroclinic cycle. A heteroclinic network [11] is usually defined to be a union of heteroclinic cycles. In this paper, we relax the definition somewhat: we allow a heteroclinic network to consist of a set of fixed point solutions, and heteroclinic connections between them, which contains at least one heteroclinic cycle. Note that this means that not every heteroclinic connection in the network need be part of a cycle.

For the example we consider in this section, the network of nodes in physical space is shown in figure 2(a). The equations governing this system are

xi+1(k)=f(xi(k))eγxi(k1),k=1,,5,x_{i+1}^{(k)}=f(x_{i}^{(k)})e^{-\gamma x_{i}^{(k-1)}},\quad k=1,\dots,5, (4)

which are equivariant with respect to a rotation symmetry of the coordinates.

Equation (4) has two different types of fixed points solution in phase space which are of interest to us, namely, those with one node active (that is, with a single component that is O(1)O(1)), or those with two nodes active. More precisely, assume for now that r[1,3]r\in[1,3], and let x^=r1r\hat{x}=\frac{r-1}{r}. Then, using coordinates (x(1),x(2),x(3),x(4),x(5))(x^{(1)},x^{(2)},x^{(3)},x^{(4)},x^{(5)}), we label the fixed points with only x(1)x^{(1)} active as:

ξ1=(x^,0,0,0,0)\xi_{1}=(\hat{x},0,0,0,0)

and similarly we have ξ2,,ξ5\xi_{2},\dots,\xi_{5}, where for each ξj\xi_{j}, the jjth component is equal to x^\hat{x}, and the remainder are equal to zero. Next, we label

ξ1,3=(x^,0,x^,0,0)\xi_{1,3}=(\hat{x},0,\hat{x},0,0)

and similarly define ξj,m\xi_{j,m}, which has the jjth and mmth components equal to x^\hat{x}, where |jm|1|j-m|\neq 1 (i.e. jj and mm are not adjacent nodes in the ring graph). Note that ξj,mξm,j\xi_{j,m}\equiv\xi_{m,j} but we typically list jj and mm in increasing numerical order.

Note that in this example, there cannot be any fixed points with more than two components equal to x^\hat{x}, because of the connectivity of the graph: two nodes which are connected by an edge cannot both be active at a fixed point. In larger, more general graphs, we would expect to see fixed points with more active components (see section III for the general setup).

We next consider the dynamics of (4) in two two-dimensional subspaces, and show that there exist heteroclinic connections from ξj\xi_{j} to ξj1\xi_{j-1} and from ξj\xi_{j} to ξj,j±2\xi_{j,j\pm 2} (where indices are taken mod5\mod 5).

For the first, consider the dynamics in the subspace where x(2)=x(3)=x(4)=0x^{(2)}=x^{(3)}=x^{(4)}=0, namely the system

xi+1(1)=rxi(1)(1xi(1))eγxi(5),xi+1(5)=rxi(5)(1xi(5))\begin{split}x_{i+1}^{(1)}&=rx^{(1)}_{i}(1-x^{(1)}_{i})e^{-\gamma x_{i}^{(5)}},\\ x_{i+1}^{(5)}&=rx^{(5)}_{i}(1-x^{(5)}_{i})\end{split} (5)

System (5) has fixed points at (x(1),x(5))=(x^,0)ξ1(x^{(1)},x^{(5)})=(\hat{x},0)\equiv\xi_{1} and (x(1),x(5))=(0,x^)ξ5(x^{(1)},x^{(5)})=(0,\hat{x})\equiv\xi_{5}. Consider an initial condition close to ξ1\xi_{1}, but with x0(5)0x^{(5)}_{0}\neq 0. Since the x(5)x^{(5)} equation is decoupled from x(1)x^{(1)}, then it behaves as it would in the uncoupled logistic map, specifically, the x(5)x^{(5)} component initially grows and approaches the value x^\hat{x}. As x(5)x^{(5)} grows, the coupling term in the x(1)x^{(1)} equation has the effect of essentially reducing the rr value of the logistic map in the x(1)x^{(1)} equation to, eventually, reγx^re^{-\gamma\hat{x}}. Thus, if reγx^<1re^{-\gamma\hat{x}}<1, then x(1)x^{(1)} will eventually decay to zero, and the trajectory approaches ξ5\xi_{5}. There is thus a heteroclinic connection from ξ1\xi_{1} to ξ5\xi_{5}, and by symmetry, heteroclinic cycles from ξj\xi_{j} to ξj1\xi_{j-1}.

For the second type of connection, consider the dynamics in the subspace where x(2)=x(4)=x(5)=0x^{(2)}=x^{(4)}=x^{(5)}=0, namely the system

xi+1(1)=rxi(1)(1xi(1)),xi+1(3)=rxi(3)(1xi(3))\begin{split}x_{i+1}^{(1)}&=rx^{(1)}_{i}(1-x^{(1)}_{i}),\\ x_{i+1}^{(3)}&=rx^{(3)}_{i}(1-x^{(3)}_{i})\end{split} (6)

In this subspace, both x(1)x^{(1)} and x(3)x^{(3)} are decoupled from each other. There are three fixed points, (x(1),x(3))=(x^,0)ξ1(x^{(1)},x^{(3)})=(\hat{x},0)\equiv\xi_{1}, (x(1),x(3))=(0,x^)ξ3(x^{(1)},x^{(3)})=(0,\hat{x})\equiv\xi_{3}, and (x(1),x(3))=(x^,x^)ξ1,3(x^{(1)},x^{(3)})=(\hat{x},\hat{x})\equiv\xi_{1,3}. Both ξ1\xi_{1} and ξ3\xi_{3} are saddle points, and perturbations close to these fixed points will result in trajectories which approach ξ1,3\xi_{1,3}. There are thus heteroclinic connections between ξ1\xi_{1} and ξ1,3\xi_{1,3}, ξ3\xi_{3} and ξ1,3\xi_{1,3}, and by analogy, heteroclinic connections between any ξj\xi_{j} and ξj,m\xi_{j,m} or ξm,j\xi_{m,j}.

Finally, we consider the dynamics of (4) in a three-dimensional subspace, and show that there is a heteroclinic connection from ξj,j+2\xi_{j,j+2} to ξj1,j+2\xi_{j-1,j+2}. Consider the dynamics in the subspace where x(2)=x(4)=0x^{(2)}=x^{(4)}=0, namely the system

xi+1(1)=rxi(1)(1xi(1))eγxi(5),xi+1(3)=rxi(3)(1xi(3)),xi+1(5)=rxi(5)(1xi(5)).\begin{split}x_{i+1}^{(1)}&=rx^{(1)}_{i}(1-x^{(1)}_{i})e^{-\gamma x_{i}^{(5)}},\\ x_{i+1}^{(3)}&=rx^{(3)}_{i}(1-x^{(3)}_{i}),\\ x_{i+1}^{(5)}&=rx^{(5)}_{i}(1-x^{(5)}_{i}).\end{split} (7)

There are, as before, fixed points in this system with one component non-zero, but of interest right now are the two fixed points with (x(1),x(3),x(5))=(x^,x^,0)ξ1,3(x^{(1)},x^{(3)},x^{(5)})=(\hat{x},\hat{x},0)\equiv\xi_{1,3} and (x(1),x(3),x(5))=(0,x^,x^)ξ3,5(x^{(1)},x^{(3)},x^{(5)})=(0,\hat{x},\hat{x})\equiv\xi_{3,5}. Note first that the x(3)x^{(3)} and x(5)x^{(5)} components are decoupled. Both have stable fixed points at x(i)=x^x^{(i)}=\hat{x}. Thus perturbations close to ξ1,3\xi_{1,3} will have an x(3)x^{(3)} component which remains close to x^\hat{x}, but, as in the case of the connection between ξ1\xi_{1} and ξ5\xi_{5}, the x(5)x^{(5)} component will grow, and again, so long as reγx^<1re^{-\gamma\hat{x}}<1, the x(1)x^{(1)} component will decay to zero.

Due to the rotational symmetry of the system (4), we thus have three families of heteroclinic connections, namely:

ξjξj1ξjξj,k,k=j±2ξj,j+2ξj1,j+2\begin{split}\xi_{j}&\rightarrow\xi_{j-1}\\ \xi_{j}&\rightarrow\xi_{j,k},\quad k=j\pm 2\\ \xi_{j,j+2}&\rightarrow\xi_{j-1,j+2}\end{split} (8)

Note that here, indices are taken mod5\mod 5. In later sections, indicies are taken modn\mod n, where nn is the number of nodes in the graph. We refer to the families of heteroclinic connections as 111\rightarrow 1 connections, 121\rightarrow 2 connections and 222\rightarrow 2 connections respectively, where a pqp\rightarrow q connection is a transition from a fixed point with pp nodes active to a fixed point with qq nodes active.

The complete set of connections between fixed points is shown in panel (b) of figure 2. Notice that there are two heteroclinic cycles, one between fixed points of type ξj\xi_{j}, with 111\rightarrow 1 connections, and the other between fixed points of type ξj,k\xi_{j,k}, with 222\rightarrow 2 connections. The 121\rightarrow 2 connections are not part of any cycles. In figure 3 we show numerical simulations showing trajectories close to each of these cycles. We will compute the stability of cycles of these types in general in section IV that follows. We shall see that the cycle between fixed points of type ξj,k\xi_{j,k} can have some form of stablility, if parameters are chosen correctly, specifically, if γ>3logr2x^\gamma>\frac{3\log r}{2\hat{x}}, but the cycle between fixed points of type ξj\xi_{j} can never be stable. However, if initial conditions are chosen carefully (in a manner described in that section), we can, as seen in panel (b) of figure 3, observe this cycle for a reasonably long period of time.

Refer to captionRefer to caption

logx(k)\log x^{(k)}

logx(k)\log x^{(k)}

iiii(a)(b)
Figure 3: The figure shows trajectories of equation (4) cycling between fixed points with (a) two nodes active and (b) one node active. The components x(1),,x(5)x^{(1)},\dots,x^{(5)} are represented by the colours blue, red, yellow, purple and green, respectively. Both panels have r=2r=2. Panel (a) has γ=3.04\gamma=3.04, panel (b) has γ=6.24\gamma=6.24. The cycle shown in (a) is fragmentarily asymptotically stable, but the one in (b) is not, as can be seen at i850i\approx 850 where x5x_{5} (green) becomes O(1)O(1) and x2x_{2} (red) remains on, indicating that the trajectory has moved away from the cycle with only one node active at any one time.

III Enumeration of fixed points and heteroclinic connections for a general directed graph

In this section, we describe how to find the fixed points and heteroclinic connections in phase space for any directed graph with inhibitory coupling. In section IV that follows, we apply this to an nn-node graph with nearest-neighbour coupling.

III.1 Enumeration of fixed points

For convenience and readability, we restate the general system (1) with NN nodes:

xi+1(k)=f(xi(k))eγk^Ak^kxi(k^),k=1,,Nx_{i+1}^{(k)}=f(x_{i}^{(k)})e^{-\gamma\sum_{\hat{k}}A_{\hat{k}k}x_{i}^{(\hat{k})}},\quad k=1,\dots,N

where Ak^kA_{\hat{k}k} is an adjacency matrix. We enumerate the fixed points that can occur in this system, specifically, those with one or more non-zero coordinates. Fixed points can have any number of non-zero coordinates, so long as the corresponding nodes are not adjacent in the physical network. More formally, consider a partition of the first NN natural numbers into two sets:

Z+={α1,α2,,αJ},Z0={β1,β2,,βNJ},Z_{+}=\{\alpha_{1},\alpha_{2},\dots,\alpha_{J}\},\quad Z_{0}=\{\beta_{1},\beta_{2},\dots,\beta_{N-J}\},

with J<NJ<N, αk,βk{1,,N}\alpha_{k},\beta_{k}\in\{1,\dots,N\}. Then the point with

x(α)\displaystyle x^{(\alpha)} =x^,αZ+,\displaystyle=\hat{x},\quad\alpha\in Z_{+},
x(β)\displaystyle x^{(\beta)} =0,βZ0,\displaystyle=0,\quad\beta\in Z_{0},

is a fixed point of (1) if Aα^α=0A_{\hat{\alpha}\alpha}=0 for all pairs (α^,α)Z+×Z+(\hat{\alpha},\alpha)\in Z_{+}\times Z_{+}. We label this fixed point ξZ+\xi_{Z_{+}}. In the language of graph theory, Z+Z_{+} is called an independent set.

III.2 Existence of heteroclinic connections in phase space

Consider a fixed point ξZ+\xi_{Z_{+}} in the system (1), with |Z+|=J|Z_{+}|=J (i.e. there are JJ nodes active). We label the set of suppressed nodes at ξZ+\xi_{Z_{+}} to be Zs(Z+)Z_{s}(Z_{+}), where

Zs(Z+)={a1,a2,,as(Z+)}Z_{s}(Z_{+})=\{a_{1},a_{2},\dots,a_{s(Z_{+})}\}

where for each ala_{l}, there exists at least one αkZ+\alpha_{k}\in Z_{+} with Aalαk=1A_{a_{l}\alpha_{k}}=1. We further define the suppression number of a node ala_{l} to be the number of different αkZ+\alpha_{k}\in Z_{+} with Aalαk=1A_{a_{l}\alpha_{k}}=1. The remaining nodes are the growing nodes, and we define Zg(Z+)={1,,N}(Z+Zs(Z+))Z_{g}(Z_{+})=\{1,\dots,N\}\setminus(Z_{+}\cup Z_{s}(Z_{+})).

It is simple to check that the linearisation of system (1) about ξZ+\xi_{Z_{+}} has the following eigenvalues:

  • JJ eigenvalues equal to 2r2-r, with eigenvectors in each of the directions corresponding to the active nodes.

  • s(Z+)s(Z_{+}) eigenvalues in the suppressed directions. Each of these will be equal to rensγx^re^{-n_{s}\gamma\hat{x}}, where nsn_{s} is the suppression number of that node.

  • NJs(Z+)N-J-s(Z_{+}) eigenvalues equal to rr. These are the growing nodes.

We assume that 1<r<31<r<3, and reγx^<1re^{-\gamma\hat{x}}<1, so each fixed point is a saddle. There are two ways in which heteroclinic connections between fixed points can arise.

Consider a fixed point ξZ+\xi_{Z_{+}}, and let b{1,,N}Z+b\in\{1,\dots,N\}\setminus Z_{+}. Consider the subspace in all components in Z+{b}Z_{+}\cup\{b\} are fixed at zero. There are then three possible cases:

  1. 1.

    bZs(Z+)b\in Z_{s}(Z_{+}), and so ξZ+\xi_{Z_{+}} is a sink in this subspace. There are no heteroclinic connections from ξZ+\xi_{Z_{+}} in this subspace.

  2. 2.

    bZg(Z+)b\in Z_{g}(Z_{+}), and Z+Zs({b})=Z_{+}\cap Z_{s}(\{b\})=\emptyset. Then there is a heteroclinic connection from ξZ+\xi_{Z_{+}} to ξZ+{b}\xi_{Z_{+}\cup\{b\}}. This is a heteroclinic connection of type |Z+||Z+|+1|Z_{+}|\rightarrow|Z_{+}|+1.

  3. 3.

    bZg(Z+)b\in Z_{g}(Z_{+}), and Z+Zs({b})=ZZ_{+}\cap Z_{s}(\{b\})=Z_{-} is non-empty. Then initial conditions near ξZ+\xi_{Z_{+}} will having an increasing x(b)x^{(b)} component. All x(a)x^{(a)} (for aZa\in Z_{-}) will eventually decay, and the trajectory will asymptote towards the fixed point ξZ+{b}{Z}\xi_{Z_{+}\cup\{b\}\setminus\{Z_{-}\}} (which has node bb active but nodes in ZZ_{-} inactive). This is a heteroclinic connection of type |Z+||Z+||Z|+1|Z_{+}|\rightarrow|Z_{+}|-|Z_{-}|+1.

Note that for the directed graph with nearest neighbour coupling, each node only inhibits one single other node, and so in case 3 above, |Z|=1|Z_{-}|=1 always. Thus for those examples, the number of active nodes can increase via way of heteroclinic connections, but it can never decrease.

IV Directed graph with nearest-neighbour coupling

In this section we consider the case of a general nn-node ring graph, with one-way nearest-neighbour coupling. That is, the system (1) with AA a cyclic permutation matrix, given by equations

xi+1(k)=f(xi(k))eγxi(k1),k=1,,N.x_{i+1}^{(k)}=f(x_{i}^{(k)})e^{-\gamma x_{i}^{(k-1)}},\quad k=1,\dots,N. (9)

We refer to these graphs as (N,1)(N,1)-graphs.

Note that the system (9) is equivariant with respect to the group N\mathbb{Z}_{N}, generated by the element σ\sigma, which has action

σ(x(1),,x(N))=(x(N),x(1),,x(N1))\sigma(x^{(1)},\dots,x^{(N)})=(x^{(N)},x^{(1)},\dots,x^{(N-1)}) (10)

As for the five-node system, equations (9) have nn fixed point solutions ξj\xi_{j} each with the jjth component equal to x^\hat{x}, and all other components zero. Other fixed points are found using the method in section III.1111For the (N,1)(N,1)-graph case the fixed points can be enumerated directly with the Lucas numbers LnL_{n}, given by L1=1,L2=3,Ln=Ln1+Ln2,n3L_{1}=1,L_{2}=3,L_{n}=L_{n-1}+L_{n-2},n\geq 3. The (N,1)(N,1)-graph has LnL_{n} fixed points, including the configuration with NN zero components.. Note that for any set of nodes Z+Z_{+}, Zs(Z+)=|Z+|Z_{s}(Z_{+})=|Z_{+}|, that is, the number of suppressed nodes is the same as the number of active nodes, and each suppressed node has a suppression number of one.

IV.1 Examples of heteroclinic networks

Using the methods described in section III we give some further examples of the heteroclinic networks which occur in (N,1)(N,1)-graphs.

IV.1.1 (6,1)(6,1)-graph

The (6,1)(6,1)-graph has six fixed points with one non-zero component, nine with two non-zero components, and two with three non-zero components. The latter are stable and the remainder are saddles. Each of the ξj\xi_{j} fixed points with one non-zero component has heteroclinic connections to ξj1\xi_{j-1}, and to the three fixed points ξj,j+2\xi_{j,j+2}, ξj,j+3\xi_{j,j+3} and ξj,j+4\xi_{j,j+4} with two non-zero components. Note that the fixed points with two non-zero components can be divided into two classes depending on whether the spaces between the active components is 22 and 22 (the fixed points ξj,j+3\xi_{j,j+3}) or 11 and 33 (the fixed points ξj,j+2\xi_{j,j+2}). The subset of the heteroclinic network between just these fixed points is shown in figure 4 .

Refer to captionξ1,4\xi_{1,4}ξ3,6\xi_{3,6}ξ4,6\xi_{4,6}ξ2,4\xi_{2,4}ξ2,6\xi_{2,6}ξ2,5\xi_{2,5}ξ3,5\xi_{3,5}ξ1,3\xi_{1,3}ξ1,5\xi_{1,5}
Figure 4: The figure shows part of the resulting heteroclinic network between fixed points for the (6,1)(6,1)-graph. Not shown are the ξj\xi_{j} fixed points, the heteroclinic connections from these, or the xj,j+2,j+4x_{j,j+2,j+4} fixed points (which are stable).

IV.1.2 (7,1)(7,1)-graph

The (7,1)(7,1)-graph has seven fixed points with one non-zero component, fourteen with two non-zero components, and seven with three non-zero components. The fixed points with two non-zero components can further be divided into two classes of types ξj,j+2\xi_{j,j+2} and ξj,j+3\xi_{j,j+3}. The heteroclinic network between the fixed points with two or three non-zero components is shown in figure 5. Each of the ξj\xi_{j} fixed points, which is not shown here, will have heteroclinic connections to ξj1\xi_{j-1}, ξj,j+2\xi_{j,j+2}, ξj,j+3\xi_{j,j+3} and ξj,j+4\xi_{j,j+4}.

Refer to captionξ1,3,5\xi_{1,3,5}ξ3,5,7\xi_{3,5,7}ξ2,5,7\xi_{2,5,7}ξ1,3,6\xi_{1,3,6}ξ2,4,7\xi_{2,4,7}ξ1,4,6\xi_{1,4,6}ξ2,4,6\xi_{2,4,6}ξ1,3\xi_{1,3}ξ5,7\xi_{5,7}ξ3,5\xi_{3,5}ξ1,6\xi_{1,6}ξ2,7\xi_{2,7}ξ4,6\xi_{4,6}ξ2,4\xi_{2,4}ξ3,7\xi_{3,7}ξ1,5\xi_{1,5}ξ3,6\xi_{3,6}ξ1,4\xi_{1,4}ξ2,6\xi_{2,6}ξ2,5\xi_{2,5}ξ4,7\xi_{4,7}
Figure 5: The figure shows part of the resulting heteroclinic network between fixed points for the (7,1)(7,1)-graph. Not shown are the ξj\xi_{j} fixed points and the heteroclinic connections from these.

IV.2 Symmetric subcycles

As can be seen from the examples given so far of the (5,1)(5,1)-, (6,1)(6,1)- and (7,1)(7,1)-graphs, there can exist many different heteroclinic cycles within the heteroclinic network in phase space. As the number of nodes in the ring graph increases, so too will the number of heteroclinic cycles. In the following, we establish stability results for some of these subcycles. Although in theory our method can be used for any subcycle, in practise it is much easier to compute explicit stability conditions if the cycle is symmetric. That is, if the cycle is between nn fixed points ζ1,,ζn\zeta_{1},\dots,\zeta_{n}, then there exist a symmetry ρ=σM\rho=\sigma^{M} (for some MM) such that ζj=ρζj1\zeta_{j}=\rho\zeta_{j-1} for all j2,,nj\in 2,\dots,n (and ζ1=ρζn\zeta_{1}=\rho\zeta_{n}).

Note that for both the (6,1)(6,1) and the (7,1)(7,1)-graph, such cycles exist between the ξj\xi_{j} fixed points. For the (7,1)(7,1)-graph, symmetric cycles also exist between the ξj,j+3\xi_{j,j+3} fixed points and the ξj,j+2,j+4\xi_{j,j+2,j+4} fixed points. However, for the (6,1)(6,1)-graph, there is no symmetric cycle between fixed points with two non-zero components (see again figure 4).

In this section we enumerate the possible symmetric cycles in (N,1)(N,1)-graphs. Clearly, the symmetry requires the number of active coordinates at each fixed point to be the same, and additionally, that the spacing of the active coordinates around the ring is the same at each fixed point. This gives restrictions on the allowed spacing between the on nodes, as follows.

{(00000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

{(0000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

{(0000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

n2n_{2}n3n_{3}n1n_{1}Refer to caption

{(00000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

{(0000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

{(000000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\\ 0\\ 0\\ 0\end{pmatrix}}\right.

n2n_{2}n3+1n_{3}+1n11n_{1}-1Refer to caption(a)(b)
Figure 6: The figure shows schematic diagrams of two fixed points in an NN-ring graph with nearest-neighbour one-way connections. The blue nodes are active, the red nodes are supressed and the remainder are green. The fixed points are considered to be adjacent in a heteroclinic cycle, and the numbers (e.g. n1n_{1}) indicate the number of green nodes between the red/blue pairs.

In figure 6(a), we show an nn-node ring graph, and suppose that there are three nodes which are active (coloured blue). The nodes coloured red are those which are being supressed by the blue nodes, and all others are coloured green. Suppose that there are n1n_{1}, n2n_{2} and n3n_{3} green nodes between each pair of blue and red nodes (as marked in the figure) (where n11n_{1}\geq 1, n2,n30n_{2},n_{3}\geq 0). In order for the next fixed point to have the same number of active components, the next node to reach O(1)O(1) much be adjacent to a blue node: the heteroclinic connection must of type 333\rightarrow 3. Without loss of generality, we suppose that the next node to reach O(1)O(1) is the node marked with a yellow star. The next fixed point in the cycle thus has nodes coloured as in figure 6(b) (the yellow star marks the same node). There are then two options for how we could rotate the arrangement at the second fixed point to match the arrangement at the first. Either (i) we rotate panel (b) anticlockwise by n1+1n_{1}+1 nodes, and must therefore have

n11=n2,n2=n3,n3+1=n1n_{1}-1=n_{2},\quad n_{2}=n_{3},\quad n_{3}+1=n_{1}

which implies n2=n3=n11n_{2}=n_{3}=n_{1}-1; or, (ii), we rotate panel (b) clockwise by n1+1n_{1}+1 nodes, and then we must have

n11=n3,n3+1=n2,n2=n1n_{1}-1=n_{3},\quad n_{3}+1=n_{2},\quad n_{2}=n_{1}

which implies n1=n2=n3+1n_{1}=n_{2}=n_{3}+1.

If there are instead J>3J>3 nodes active, rather than just three, similar arguments can be made, and the results give the same two possible cases. In case (i), we write n1=p1n_{1}=p-1, n2,,nJ=p2n_{2},\dots,n_{J}=p-2, and the total number of nodes is N=pJ+1N=pJ+1, for some p2p\geq 2. In case (ii), we write nJ=s3n_{J}=s-3, n1,,nJ1=s2n_{1},\dots,n_{J-1}=s-2 and the total number of nodes is N=sJ1N=sJ-1, for some s3s\geq 3.

In the case where there is only a single active node (J=1J=1), then clearly all fixed points are symmetric. In the case where J=2J=2, the same arguments apply as for J=3J=3 or more, except that there is no distinction between cases (i) and (ii) above.

Note that in both cases (i) and (ii), the spacing between the active nodes is such that all gaps between active nodes are of equal length except one that is one greater or fewer than the others. In figure 7 we show four possible types of fixed points in the graph with N=11N=11, with two, three, four and five active nodes respectively. The fixed points with three (figure 7(b)) and four (figure 7(c)) active nodes are in case (ii): one gap is smaller than the others. The fixed point with five active nodes (figure 7(d)) is in case (i): one gap is bigger than the others.

The maximum value that JJ can take (the maximum number of active nodes at a fixed point) is equal to N/2N/2 if NN is even, and (N1)/2(N-1)/2 if NN is odd. We refer to these fixed points as maximally active fixed points.

Refer to captionRefer to captionRefer to captionRefer to caption(a)(b)(c)(d)
Figure 7: The figures show fixed points in an eleven node network with (a) two, (b) three, (c) four, and (d) five active nodes respectively. Each of these fixed points has a spacing between the active nodes where all gaps are equal except one, that is one greater or fewer than the others.

IV.3 Construction and analysis of heteroclinic cycles

We now specifically construct a heteroclinic connection between two fixed points, and use this construction to show how the stability of a heteroclinic cycle between fixed points can be computed. We first consider the dynamics within an epoch, which we define to be the length of time a trajectory spends in a neighbourhood of a single fixed point. We then discuss how the trajectory transitions between epochs. This method echos the construction of Poincaré maps which is typical in analysis of heteroclinic cycles in continuous-time systems [11, 13, 14, 8].

IV.3.1 Dynamics within one epoch

Refer to captionO(1)O(1)logxein\log x_{e}^{\mathrm{in}}logxtJ1in\log x_{t_{J-1}}^{\mathrm{in}}logxs1in\log x_{s_{1}}^{\mathrm{in}}logxt1in\log x_{t_{1}}^{\mathrm{in}}logxs2in\log x_{s_{2}}^{\mathrm{in}}logxsLin\log x_{s_{L}}^{\mathrm{in}}logxs1out\log x_{s_{1}}^{\mathrm{out}}logxcout\log x_{c}^{\mathrm{out}}logxs2out\log x_{s_{2}}^{\mathrm{out}}logxtJ1out\log x_{t_{J-1}}^{\mathrm{out}}logxsLout\log x_{s_{L}}^{\mathrm{out}}logxt1out\log x_{t_{1}}^{\mathrm{out}}ii
Figure 8: The figure shows a schematic of a time series of one epoch of a trajectory close to a fixed point in system (9).

Consider the dynamics of (9), with NN nodes in the graph, near a fixed point at which JJ nodes are active, that is, an equilibrium at which JJ components are equal to x^\hat{x}. Then, by the arguments given in section III.2, there will be JJ negative eigenvalues, and hence JJ components which are decaying. Similarly, there will be N2JN-2J components which are growing. We give a schematic sketch of this in figure 8, and note that the only initial condition we have specified is that one of the decaying components starts at O(1)O(1). We have further specified that one of the growing components reaches O(1)O(1) at the end of the period of time shown in the figure. We label this period of time one epoch, and note that after this epoch, the trajectory will be in the neighbourhood of a different fixed point, which may have the same, or one more, nodes that are active.

We label each of the growing components, in order of largest to smallest initial conditions:

xe,xs1,,xsL,x_{e},x_{s_{1}},\dots,x_{s_{L}},

where L=N2J1L=N-2J-1, and we label each of the decaying components, again in order of largest to smallest initial conditions:

xc,xtJ1,xtJ2,,xt1.x_{c},x_{t_{J-1}},x_{t_{J-2}},\dots,x_{t_{1}}.

We use a superscript ‘in’ and ‘out’ to indicate the initial, and final, conditions for each of the components. Recall that each of the growing components grows at a rate r>1r>1, and each of the decaying components decays at a rate rexp(γx^)<1r\exp(-\gamma\hat{x})<1. Let the number of iterations in the epoch shown in figure 8 be TT, and then we have

log(xein)+Tlogr=O(1),\log(x_{e}^{\mathrm{in}})+T\log r=O(1),

or, assuming that xein1x_{e}^{\mathrm{in}}\ll 1 and hence TT is large

T=log(xein)logr+O(1).T=-\frac{\log(x_{e}^{\mathrm{in}})}{\log r}+O(1).

We can then use this expression for TT to compute the ‘out’ coordinates of the other components in terms of the ‘in’ components. Specifically, we find

log(xsiout)\displaystyle\log(x_{s_{i}}^{\mathrm{out}}) =log(xsiin)log(xein),i=1,,L,\displaystyle=\log(x_{s_{i}}^{\mathrm{in}})-\log(x_{e}^{\mathrm{in}}),\quad i=1,\dots,L,
log(xtiout)\displaystyle\log(x_{t_{i}}^{\mathrm{out}}) =log(xtiin)+(γx^logr1)log(xein),i=1,,J1,\displaystyle=\log(x_{t_{i}}^{\mathrm{in}})+\left(\frac{\gamma\hat{x}}{\log r}-1\right)\log(x_{e}^{\mathrm{in}}),\quad i=1,\dots,J-1,
log(xcout)\displaystyle\log(x_{c}^{\mathrm{out}}) =(γx^logr1)log(xein).\displaystyle=\left(\frac{\gamma\hat{x}}{\log r}-1\right)\log(x_{e}^{\mathrm{in}}).

We write δ=(γx^logr1)\delta=\left(\frac{\gamma\hat{x}}{\log r}-1\right), and Xc=log(xc)X_{c}=\log(x_{c}) etc, and then have the following linear map from the ‘in’ variables to the ‘out’ variables:

(XsioutXtioutXcout)=(1lIl0δ1j10Ij1δ00)(XeinXsiinXtiin)\begin{pmatrix}X_{s_{i}}^{\mathrm{out}}\\ X_{t_{i}}^{\mathrm{out}}\\ X_{c}^{\mathrm{out}}\end{pmatrix}=\begin{pmatrix}-1_{l}&I_{l}&0\\ \delta 1_{j-1}&0&I_{j-1}\\ \delta&0&0\end{pmatrix}\begin{pmatrix}X_{e}^{\mathrm{in}}\\ X_{s_{i}}^{\mathrm{in}}\\ X_{t_{i}}^{\mathrm{in}}\end{pmatrix} (11)

where 1m1_{m} is a length mm column vector of 11’s, and ImI_{m} is the m×mm\times m identity matrix.

IV.3.2 Transitions between epochs

In this section, we discuss how to map the ‘out’ variables given in equation (11) onto a new set of ‘in’ variables for the next epoch.

In figure 9 we show how the nodes are labelled (as in the time series schematic shown in figure 8), for case (i). The node with the yellow star is xex_{e}, as described above. The remaining growing nodes are xs1,,xsLx_{s_{1}},\dots,x_{s_{L}}, where L=N2J1L=N-2J-1. As per the labelling scheme in figure 8, xs1x_{s_{1}} is the component which will become O(1)O(1) next in the sequence (following xex_{e}), and by applying the necessary rotations between fixed points, it can be seen how this node is selected. Similar arguments explain how the other growing nodes are labelled. The labelling of the contracting nodes is done in a similar fashion: xcx_{c} is the component which was O(1)O(1) at the start of the epoch, and hence was blue in the previous fixed point: application of the rotation between panels (a) and (b) in figure 6 gives us this label. The xtix_{t_{i}} labels are found in a similar way.

This results, for case (i), in the following transformation between the ‘out’ coordinates of the last fixed point, and the ‘in’ coordinates of the next one:

xs1out\displaystyle x_{s_{1}}^{\mathrm{out}} =xein\displaystyle=x_{e}^{\mathrm{in}}
xsiout\displaystyle x_{s_{i}}^{\mathrm{out}} =xsi1in,i=2,,L,\displaystyle=x_{s_{i-1}}^{\mathrm{in}},\quad i=2,\dots,L,
xt1out\displaystyle x_{t_{1}}^{\mathrm{out}} =xslin,\displaystyle=x_{s_{l}}^{\mathrm{in}},
xtiout\displaystyle x_{t_{i}}^{\mathrm{out}} =xti1in,i=2,,J\displaystyle=x_{t_{i-1}}^{\mathrm{in}},\quad i=2,\dots,J
xcout\displaystyle x_{c}^{\mathrm{out}} =xtJin.\displaystyle=x_{t_{J}}^{\mathrm{in}}.

{(000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\end{pmatrix}}\right.

{(000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\end{pmatrix}}\right.

{(000)\left\{\color[rgb]{1,1,1}{\begin{pmatrix}0\\ 0\\ 0\end{pmatrix}}\right.

p2p-2p2p-2p1p-1Refer to captionxex_{e}xcx_{c}xt1x_{t_{1}}xtJx_{t_{J}}xs1x_{s_{1}}xs2x_{s_{2}}xsLx_{s_{L}}
Figure 9: The figure shows labelling of the nodes in case (i).

Combing this with the linear map in (11) we get that the logarithmic coordinates each epoch are transformed under the map

XMXX\rightarrow MX (12)

where MM is called a transition matrix and is given by

M=(11000001010000100100δ00100δ000001δ000000).M=\begin{pmatrix}-1&1&0&0&0&\dots&0&0\\ -1&0&1&0&0&\dots&0&0\\ \vdots&\vdots&\ddots&\ddots&\ddots&&&\vdots\\ -1&0&\dots&0&1&0&\dots&0\\ \delta&0&\dots&&0&1&0&0\\ \vdots&\vdots&&&&\ddots&\ddots&\vdots\\ \delta&0&\dots&0&0&0&0&1\\ \delta&0&\dots&0&0&0&0&0\end{pmatrix}. (13)

The matrix MM is a q×qq\times q-square matrix, where q=NJ1=J(p1)q=N-J-1=J(p-1). There are L=N2J1=J(p2)L=N-2J-1=J(p-2) rows starting with a 1-1 and JJ rows starting with a δ\delta, and 11’s on the upper diagonal. Here δ=γx^logr1\delta=\frac{\gamma\hat{x}}{\log r}-1, as before.

In case (ii), the labelling of the coordinates can be computed in the same way (although the labelling turns out to be different), but the resulting map is exactly the same. That is, MM is a q×qq\times q-square matrix, with q=NJ1=J(s1)2q=N-J-1=J(s-1)-2, the number of rows of MM starting with a 1-1 is L=N2J1=J(s2)2L=N-2J-1=J(s-2)-2, the number of rows starting with a δ\delta is still JJ.

In the original xx coordinates, the map (12) has a fixed point at x=0x=0, which corresponds to the heteroclinic cycle in the original system. Podvigina [8] gives results on the stability of this heteroclinic cycle, dependent on properties of the eigenvalues and eigenvectors of the transition matrix. In the next section we give a brief heuristic argument explaining Podvigina’s results, and then state the precise requirements for stability.

IV.4 Transition matrices and fragmentary asymptotic stability

We begin this section with some formal definitions, referring back to a generic dynamical system of the form (3).

We define the δ\delta-local basin of attraction of a set HH, invariant under ff, as δ(H)\mathcal{B}_{\delta}(H):

δ(H)={𝐱n||fi(𝐱),H|<δi0,andlimi|fi(𝐱),H|=0}.\begin{split}\mathcal{B}_{\delta}(H)=\{\mathbf{x}\in\mathbb{R}^{n}~{}|~{}|f^{i}(\mathbf{x}),H|<\delta\ \forall\ i\geq 0,\ \\ \mathrm{and}\ \lim_{i\rightarrow\infty}|f^{i}(\mathbf{x}),H|=0\}.\end{split} (14)

From Podvigina [8], we also have:

Definition 1.

An invariant set HH is fragmentarily asymptotically stable if, for any δ>0\delta>0,

μ(δ(X))>0,\mu(\mathcal{B}_{\delta}(X))>0,

where μ\mu is the Lebesgue measure of a set in n\mathbb{R}^{n}.

Now suppose that for a heteroclinic cycle HH, we have derived a Poincaré map in logarithmic coordinates, as in the previous section, of the form

Xi+1=MXiX_{i+1}=MX_{i}

Here the subscript index ii now counts epochs, rather than individual iterations of the original map. Let XiX_{i} have dimension qq, so MM is an q×qq\times q matrix, and then we can write the initial condition X0X_{0}, in the basis of eigenvectors vjv_{j} of MM, i.e.

X0=Σj=1qcjvjX_{0}=\Sigma_{j=1}^{q}c_{j}v_{j}

where the cjc_{j} are scalars. Then we find

Xi=Σj=1qλjicjvjX_{i}=\Sigma_{j=1}^{q}\lambda_{j}^{i}c_{j}v_{j}

where λj\lambda_{j} is the eigenvalue corresponding to the eigenvector vjv_{j}. Let λmax\lambda_{\max} be the eigenvalue with largest absolute value, and then the leading order term of XiX_{i} is

XiλmaxicmaxvmaxX_{i}\approx\lambda_{\max}^{i}c_{\max}v_{\max}

Recall that XiX_{i} are logarithmic variables, so xi0x_{i}\rightarrow 0 if XiX_{i}\rightarrow-\infty, that is, in order for the heteroclinic cycle to be stable, we require at least that |λmax|>1|\lambda_{\max}|>1. However, in addition, the XiX_{i} are required to stay real and negative, so additional conditions are required, namely that λmax\lambda_{\max} is real, and that all the entries in the eigenvector vmaxv_{\max} are of the same sign. Podvigina shows that if these conditions are satisfied, then there exists an open set of initial conditions which remain close to the heteroclinic cycle for all time, more specifically, the heteroclinic cycle is fragmentarily asymptotically stable.

Lemma 1 (Adapted from Podvigina [8]).

Let MM be a transition matrix for a heteroclinic cycle HH. Let λmax\lambda_{\mathrm{max}} be the eigenvalue with largest absolute value of the matrix MM, and vmaxv_{\max} be the associated eigenvector. Suppose λmax1\lambda_{\mathrm{max}}\neq 1. Then HH is fragmentarily asymptotically stable if the following conditions hold:

  1. 1.

    λmax\lambda_{\mathrm{max}} is real

  2. 2.

    λmax>1\lambda_{\mathrm{max}}>1

  3. 3.

    vmaxlvmaxj>0v_{\mathrm{max}}^{l}v_{\mathrm{max}}^{j}>0 for all l,jl,j.

Note that the last condition is equivalent to requiring all the entries of the eigenvector vmaxv_{\mathrm{max}} to be non-zero and of the same sign.

IV.5 Stability calculations

In this section, we will prove

Theorem 1.

Let δ=q+1JJ\delta^{*}=\frac{q+1-J}{J}. If q=Jq=J, then the corresponding heteroclinic cycle is f.a.s. if δ>δ\delta>\delta^{*}, and is unstable otherwise. All heteroclinic cycles with q>Jq>J are unstable.

Note that δ>δ\delta>\delta^{*} is equivalent to γ>logrx^NJJ\gamma>\frac{\log r}{\hat{x}}\frac{N-J}{J}.

We prove theorem 1 by presenting results about the eigenvalues of the matrix MM. First note that the characteristic polynomial of MM is

P(λ)=λq+λq1++λJδ(λJ1++λ+1)=0P(\lambda)=\lambda^{q}+\lambda^{q-1}+\dots+\lambda^{J}-\delta(\lambda^{J-1}+\dots+\lambda+1)=0 (15)

(this follows, e.g. from Claim 1 in Postlethwaite and Dawes, 2010 [15], page 629), and recall that q=J(p1)q=J(p-1), p2p\geq 2, J1J\geq 1. To establish properties of the roots of the polynomial P(λ)P(\lambda) we will appeal to three classical results.

Theorem 2 (Descartes Rule of Signs).

For a polynomial with real coefficients, ordered by descending variable exponent, the number of positive roots of the polynomial is either equal to the number of sign changes between consecutive (nonzero) coefficients, or is less than it by an even number. A root of multiplicity kk is counted as kk roots.

Of the qq complex roots of P(λ)P(\lambda), exactly one, r+r_{+}, is real and positive, by theorem 2. Next, given a polynomial

f(x)=anxn+an1xn1++a1x+a0,f(x)=a_{n}x^{n}+a_{n-1}x^{n-1}+\ldots+a_{1}x+a_{0},

with an0a_{n}\neq 0, define

f+(x)\displaystyle f_{+}(x) =|an|xn+|an1|xn1++|a1|x|a0|\displaystyle=|a_{n}|x^{n}+|a_{n-1}|x^{n-1}+\ldots+|a_{1}|x-|a_{0}|
f(x)\displaystyle f_{-}(x) =|an|xn|an1|xn1|a1|x|a0|,\displaystyle=|a_{n}|x^{n}-|a_{n-1}|x^{n-1}-\ldots-|a_{1}|x-|a_{0}|,

and note that theorem 2 shows that f+(x)f_{+}(x) has exactly one real positive root, f+^>0\hat{f_{+}}>0, and f(x)f_{-}(x) has exactly one real positive root f^>0\hat{f_{-}}>0.

Theorem 3 (Cauchy [9]).

All zeros zz of f(x)f(x) lie in the annular region

f+^|z|f^.\hat{f_{+}}\leq|z|\leq\hat{f_{-}}.

We will also use

Theorem 4 (Rouché [10]).

Let ff and gg be functions analytic inside and on a simple closed contour CC, and suppose |g(z)|<|f(z)||g(z)|<|f(z)| on CC. Then both ff and f+gf+g have the same number of zeros inside CC (with each zero counted as many times as its multiplicity).

We will prove

Proposition 1.

The polynomial P(λ)P(\lambda) (with δ>0\delta>0) has roots satisfying the following:

  1. 1.

    When q=Jq=J, r+>1r_{+}>1 is the root of largest magnitude.

  2. 2.

    When q>Jq>J we have the following cases:

    1. (a)

      If JJ is odd and qq is even, the root of largest magnitude is real and negative. Call this root rr_{-}; then there are q1q-1 roots inside |λ|=r|\lambda|=r_{-}, one of which is r+r_{+}, and q2q-2 of which are complex.

    2. (b)

      If JJ and qq are both even, or if qq is odd, then there are J1J-1 roots inside |λ|=max{r+,1}|\lambda|=\max\{r_{+},1\}, of which exactly one, rr_{-}, is real if and only if JJ is even, and there are qJq-J complex roots outside |λ|=r+|\lambda|=r_{+}.

Proof.
  1. 1.

    First, in the case q=Jq=J, P(λ)=P(λ)P(\lambda)=P_{-}(\lambda), and so by theorem 3, all roots of P(λ)P(\lambda) are bounded in magnitude by r+r_{+}. Moreover, r+>1r_{+}>1 when δ>δ\delta>\delta^{*}.

  2. 2.

    When q>Jq>J, theorem 3 is no longer of use. It is convenient to study the related polynomial

    Q(λ)=(λ1)P(λ)=λq+1(1+δ)λJ+δ,Q(\lambda)=(\lambda-1)P(\lambda)=\lambda^{q+1}-(1+\delta)\lambda^{J}+\delta,

    which has the same roots as P(λ)P(\lambda), plus a root at λ=1\lambda=1. Considering Q(λ)=(q+1)λqJ(1+δ)λJ1Q^{\prime}(\lambda)=(q+1)\lambda^{q}-J(1+\delta)\lambda^{J-1}, and recalling that a double root of a polynomial is also a root of the polynomial’s derivative, we see that r+=1r_{+}=1 when δ=δ=(q+1J)/J\delta=\delta^{*}=(q+1-J)/J, and that

    Q(r+)=(q+1)r+qJ(1+δ)r+J1>0Q^{\prime}(r_{+})=(q+1)r_{+}^{q}-J(1+\delta)r_{+}^{J-1}>0 (16)

    when δ>δ\delta>\delta^{*} (and Q(r+)<0Q^{\prime}(r_{+})<0 when δ<δ\delta<\delta^{*}).

    1. (a)

      In the case JJ odd and qq even we have

      Q(λ)\displaystyle Q(-\lambda) =\displaystyle= λq+1+(1+δ)λJ+δ\displaystyle-\lambda^{q+1}+(1+\delta)\lambda^{J}+\delta
      =\displaystyle= Q(λ)+2δ,\displaystyle-Q(\lambda)+2\delta,

      so Q(r+)=Q(r+)+2δ=2δ>0Q(-r_{+})=-Q(r_{+})+2\delta=2\delta>0. Since Q(λ)Q(\lambda)\to-\infty as λ\lambda\to-\infty, there must exist a real root of Q(λ)Q(\lambda) between -\infty and r+-r_{+}. Thus Q(λ)Q(\lambda), and hence also P(λ)P(\lambda), has a real negative root, rr_{-}, of greater magnitude than r+r_{+}. The same argument applies to Q(1)Q(-1) so rr_{-} is also of greater magnitude than the root at λ=1\lambda=1. To show that (in this case) rr_{-} is the root of largest magnitude, we apply theorem 4, setting f(λ)=λq+1f(\lambda)=\lambda^{q+1} and g(λ)=(1+δ)λJ+δg(\lambda)=-(1+\delta)\lambda^{J}+\delta. We have, on the circle of radius |λ|=(1+ϵ)|r||\lambda|=(1+\epsilon)|r_{-}|,

      |f(λ)|\displaystyle|f(\lambda)| =\displaystyle= |(r(1+ϵ))q+1|\displaystyle|(r_{-}(1+\epsilon))^{q+1}|
      >\displaystyle> |(1+δ)(r(1+ϵ))J|+δ\displaystyle|(1+\delta)(r_{-}(1+\epsilon))^{J}|+\delta
      \displaystyle\geq |(1+δ)(r(1+ϵ))Jδ|\displaystyle|(1+\delta)(r_{-}(1+\epsilon))^{J}-\delta|
      =\displaystyle= |g(λ)|,\displaystyle|g(\lambda)|,

      where the first inequality follows since |rq+1|=|(1+δ)rJ|+δ|r_{-}^{q+1}|=|(1+\delta)r_{-}^{J}|+\delta, and the second by the triangle inequality. Then by theorem 4, Q(λ)=f(λ)+g(λ)Q(\lambda)=f(\lambda)+g(\lambda) has the same number of complex zeros inside that circle as f(λ)f(\lambda), namely q+1q+1. Hence rr_{-} is the root of largest modulus.

    2. (b)

      In the other cases we will again apply theorem 4. First consider δ<δ\delta<\delta^{*}, so r+<1r_{+}<1 and take f(λ)=(1+δ)λJf(\lambda)=-(1+\delta)\lambda^{J} and g(λ)=λq+1+δg(\lambda)=\lambda^{q+1}+\delta. For ϵ<2(1+qJ(1+δ))/(q(q+1))\epsilon<2(1+q-J(1+\delta))/(q(q+1)) (observing that ϵ>0\epsilon>0 since δ<δ\delta<\delta^{*}) we have, on the circle |λ|=1ϵ|\lambda|=1-\epsilon,

      |f(λ)|\displaystyle|f(\lambda)| =\displaystyle= |(1+δ)(1ϵ)J|\displaystyle|-(1+\delta)(1-\epsilon)^{J}|
      >\displaystyle> (1+δ)(1Jϵ)\displaystyle(1+\delta)(1-J\epsilon)
      =\displaystyle= 1+δ+ϵ(J(1+δ))\displaystyle 1+\delta+\epsilon(-J(1+\delta))
      >\displaystyle> 1+δ+ϵ((q+1)+ϵq(q+1)/2)\displaystyle 1+\delta+\epsilon(-(q+1)+\epsilon q(q+1)/2)
      =\displaystyle= 1ϵ(q+1)+ϵ2q(q+1)/2+δ\displaystyle 1-\epsilon(q+1)+\epsilon^{2}q(q+1)/2+\delta
      >\displaystyle> (1ϵ)q+1+δ\displaystyle(1-\epsilon)^{q+1}+\delta
      >\displaystyle> |(1ϵ)q+1+δ|\displaystyle|(1-\epsilon)^{q+1}+\delta|
      =\displaystyle= |g(λ)|\displaystyle|g(\lambda)|

      Similarly, if δ>δ\delta>\delta^{*}, so r+>1r_{+}>1, we inspect f(λ)f(\lambda) and g(λ)g(\lambda) on the circle |λ|=(1ϵ)r+|\lambda|=(1-\epsilon)r_{+}, with ϵ<2(1+qJ(1+δ)/rq+1J)/q(q+1)\epsilon<2(1+q-J(1+\delta)/r^{q+1-J})/q(q+1) (which is again positive by (16)). We have, similarly,

      |f(λ)|\displaystyle|f(\lambda)| =\displaystyle= |(1+δ)(1ϵ)Jr+J|\displaystyle|-(1+\delta)(1-\epsilon)^{J}r_{+}^{J}|
      >\displaystyle> (1+δ)(1Jϵ)r+J\displaystyle(1+\delta)(1-J\epsilon)r_{+}^{J}
      =\displaystyle= r+q+1+δ+ϵr+J(J(1+δ))\displaystyle r_{+}^{q+1}+\delta+\epsilon r_{+}^{J}(-J(1+\delta))
      >\displaystyle> (1ϵ)q+1r+q+1+δ\displaystyle(1-\epsilon)^{q+1}r_{+}^{q+1}+\delta
      >\displaystyle> |(1ϵ)q+1rq+1+δ|\displaystyle|(1-\epsilon)^{q+1}r^{q+1}+\delta|
      =\displaystyle= |g(z)|.\displaystyle|g(z)|.

    Theorem 4 implies that Q(λ)Q(\lambda) has JJ roots inside the circle |λ|=1ϵ|\lambda|=1-\epsilon (resp. |λ|=(1ϵ)r+)|\lambda|=(1-\epsilon)r_{+}) if δ<δ\delta<\delta^{*} (resp. δ>δ)\delta>\delta^{*}), and so P(λ)P(\lambda) has J1J-1 roots inside those circles.

Proof of theorem 1.

When q=Jq=J, proposition 1 shows that λmax\lambda_{\max} for the matrix MM is real and is >1>1 when δ\delta is sufficiently large (when δ>1/J\delta>1/J). Moreover an easy calculation shows that the corresponding eigenvector vmaxv_{\max} is given by

vmax=(1δr(k=0J21rk)δr(k=0J31rk)δr(1+1r)δr),v_{\max}=\begin{pmatrix}1\\ \frac{\delta}{r}\left(\sum_{k=0}^{J-2}\frac{1}{r^{k}}\right)\\ \frac{\delta}{r}\left(\sum_{k=0}^{J-3}\frac{1}{r^{k}}\right)\\ \vdots\\ \frac{\delta}{r}\left(1+\frac{1}{r}\right)\\ \frac{\delta}{r}\end{pmatrix}, (17)

which clearly has all entries non-zero and the same sign, and lemma 1 confirms that this state is fragmentarily asymptotically stable.

When q>Jq>J the conditions of lemma 1 are not met, as λmax\lambda_{\max} is no longer real and positive.

IV.6 Appearance of instabilities

As described in the section above, many of the heteroclinic cycles we find are unstable. However, if initial conditions are carefully chosen, then the cycles can be observed for reasonably long times in numerical simulations. Specifically, suppose that a heteroclinic cycle HH has transition matrix MM, with eigenvalues and corresponding eigenvalues λi\lambda_{i} and viv_{i}. Suppose that the heteroclinic cycle is unstable, so that the eigenvalue with largest magnitude, which without loss of generality we assume to be λ1\lambda_{1}, does not satisfy the conditions of lemma 1. Assume further that λ2\lambda_{2} does satisfy the conditions of lemma 1. Then, if we choose initial conditions X0=c2v2X_{0}=c_{2}v_{2}, then the forward trajectory will remain close to HH.

In numerical simulations, of course, errors accumulate, and the trajectory can only remain close to HH for a finite time. In figure 10(a), we show an example of a trajectory which remains close to an unstable cycle for a long time. Here, the cycle in question is the one between fixed points with one node active in the (5,1)(5,1)-graph. In figure 10(b) we show the coordinates from (a) at the bottom of each ‘valley’ in the time series: this corresponds to the coordinates at the transition between epochs and hence the coordinates XjX_{j}. For the particular transition matrix for this cycle with the noted parameters, λ1\lambda_{1} and λ2\lambda_{2} satisfy the assumptions given above, and λ1\lambda_{1} is complex. Using these values for λ1\lambda_{1} and λ2\lambda_{2}, we use least squares to estimate the values of c1c_{1}, c2c_{2} and c3c_{3} to fit the curve Xj=c1λ2j+c2|λ1|jcos(jarg(λ1)+c3)X_{j}=c_{1}\lambda_{2}^{j}+c_{2}|\lambda_{1}|^{j}\cos(j\arg(\lambda_{1})+c_{3}) to the obtained data. The dashed line in (b) shows the curve Xj=c1λ2jX_{j}=c_{1}\lambda_{2}^{j}, that is, the data that would be expected if there were no numerical error and we were able to start exactly on the required eigenvector. The solid curve includes the second term and is clearly an excellent fit to the data points.

Refer to captionRefer to caption

logx(k)\log x^{(k)}

XjX_{j}

jjii(a)(b)
Figure 10: (a) The figure shows a trajectory of equation (4) with initial condition near the unstable heteroclinic cycle between fixed points with one node active. The components x(1),,x(5)x^{(1)},\dots,x^{(5)} are represented by the colours blue, red, yellow, purple and green, respectively. Parameters are r=2r=2, γ=6.24\gamma=6.24. The blue dots in panel (b) show the coordinates at the bottom of each of the ‘valleys’ in the time series in panel (a). The dashed curve is Xj=c1λ2jX_{j}=c_{1}\lambda_{2}^{j}. The solid curve is Xj=c1λ2j+c2|λ1|jcos(jarg(λ1)+c3)X_{j}=c_{1}\lambda_{2}^{j}+c_{2}|\lambda_{1}|^{j}\cos(j\arg(\lambda_{1})+c_{3}). See text for more details.

V Analysis of ring graph with mm-nearest neighbour coupling

In this section we expand on our results from the previous section to discuss ring graphs with mm-nearest neighbour coupling (m<N/2m<N/2). We find that, depending on the number of nodes, NN, in the graph, and the number mm of neigbours coupled, different types of heteroclinic networks can arise in the dynamics. Some of these have dynamics which can be described using the same methods as in the previous section, and some of these are more complex. We refer to the NN-node graph, with mm-nearest neighbour coupling as the (N,m)(N,m)-graph.

Refer to captionRefer to captionξ1\xi_{1}ξ3\xi_{3}ξ4\xi_{4}ξ5\xi_{5}ξ2\xi_{2}(a)(b)
Figure 11: The figure shows, in panel (a), the physical network of nodes for the (5,2)(5,2)-graph, and in panel (b), the resulting heteroclinic network between fixed points.

The smallest graph which falls into this category (with m1m\neq 1) is the a five-node graph, with m=2m=2, shown in figure 11(a). In this example, it is not possible to have any fixed points which have more than one component non-zero, and the network of heteroclinic connections between these fixed points is shown on the right-hand side of figure 11. There are two-subcycles in this network between five fixed points, and the transition matrices for these cycles can be found using the methods in the previous section. We find, for the cycle ξ1ξ5ξ4ξ3ξ2\xi_{1}\rightarrow\xi_{5}\rightarrow\xi_{4}\rightarrow\xi_{3}\rightarrow\xi_{2} that the transition matrix is

(110δ01δ00).\begin{pmatrix}-1&1&0\\ \delta&0&1\\ \delta&0&0\end{pmatrix}.

The eigenvalues can be found explicitly as ±δ\pm\sqrt{\delta}, 1-1, and thus this cycle can never be fragmentarily asymptotically stable. For the cycle ξ1ξ4ξ2ξ5ξ3\xi_{1}\rightarrow\xi_{4}\rightarrow\xi_{2}\rightarrow\xi_{5}\rightarrow\xi_{3} the transition matrix is

(δ10101δ00).\begin{pmatrix}\delta&1&0\\ -1&0&1\\ \delta&0&0\end{pmatrix}.

which has eigenvalues δ\delta, ±i\pm i, but the eigenvector for the eigenvalue δ\delta has a zero in the second component, and so this cycle can also never be fragmentarily asymptotically stable. There are other routes trajectories can take whilst still approaching the network: in fact, this network is equivalent to the Rock-Paper-Scissors-Lizard-Spock network investigated by Postlethwaite and Rucklidge (for ODEs) [16], which has some very complicated dynamics: see figure 12 for a typical time series.

Refer to caption

logx(i)\log x^{(i)}

ii
Figure 12: The figure show a typical trajectory for the network shown in figure 11. The components x(1),,x(5)x^{(1)},\dots,x^{(5)} are represented by the colours blue, red, yellow, purple and green, respectively. Parameters are r=2.5r=2.5, γ=3\gamma=3. Although the network appears to be attracting (trajectories get closer to the fixed points as time increases), the sequence in which the fixed points are visited is irregular and complicated.

As a second example, consider the seven-node graph with two-nearest neighbour coupling, shown in figure 13(a). In this example, there are seven fixed points which have exactly one non-zero component, and seven with exactly two non-zero components. The heteroclinic network between these fixed points is shown in figure 13(b). Note the similarity in structure between this network and the network shown in figure 2(b). The stability of the cycles between the fixed points with either one or two non-zero components can be computed in exactly the same way as shown previously, and we find that the cycle between the fixed points with two non-zero components can be stable if δ\delta is large enough, but the other cycle cannot.

Refer to captionRefer to captionξ1,4\xi_{1,4}ξ4,7\xi_{4,7}ξ3,7\xi_{3,7}ξ1,5\xi_{1,5}ξ3,6\xi_{3,6}ξ2,5\xi_{2,5}ξ2,6\xi_{2,6}ξ1\xi_{1}ξ7\xi_{7}ξ4\xi_{4}ξ5\xi_{5}ξ3\xi_{3}ξ2\xi_{2}ξ6\xi_{6}(a)(b)
Figure 13: The figure shows, in panel (a), the physical network of nodes for the (7,2)(7,2)-graph, and in panel (b), the resulting heteroclinic network between fixed points.

As in the examples of the (N,1)(N,1) graphs, when transitioning from one fixed point to another along a heteroclinic connection, the number of active nodes may increase, but it can never decrease. We refer to those fixed points with the largest number of active nodes as the maximally-active fixed points, and in the following, discuss the possible network of heteroclinic connections between these nodes for a general (N,m)(N,m)-graph. We have the following:

  • If N=0mod(m+1)N=0\mod(m+1), then all maximally-active fixed points are asymptotically stable, and there are no heteroclinic connections.

  • If N=1mod(m+1)N=1\mod(m+1), then all maximally-active fixed points have an unstable manifold of dimension one, and there exists a heteroclinic cycle between the fixed points. The transition matrix for this heteroclinic cycle takes the form of MM in equation (13), with all rows starting with a δ\delta. It can thus be asymptotically stable if δ\delta is sufficiently large.

  • If N=pmod(m+1)N=p\mod(m+1), p0,1p\neq 0,1, then all maximally-active fixed points have an unstable manifold of dimension pp, and there exists a heteroclinic network between the fixed points. We conjecture that this network can be asymptotically stable for large enough δ\delta, but may have complex dynamics.

VI Discussion

In this paper we have shown that heteroclinic networks can typically arise in the phase space dynamics of certain types of symmetric (physical space) graphs with inhibitory coupling. We further showed that at most one of the subcycles can be stable for an open set of parameters, and hence observable in simulations. Many studies of coupled map lattices and complex networks seek asymptotic behaviour described by a Sinai-Ruelle-Bowen (SRB) invariant measure[17]. However the dynamics associated with a stable heteroclinic cycle preclude this behaviour — the dynamics is not ergodic, and long-term averages do not converge. In particular, averaged observed quantities such as Lyapunov exponents are ill-defined, and will oscillate at a progressively slower rate.

From this work arises the more general question of whether or not a stable heteroclinic cycle is likely to be found in the corresponding phase space network of a randomly generated physical network of nodes. We performed some preliminary investigations on this question numerically, for randomly generated Erdos–Rényi graphs (where each edge exists with some fixed probability). We find that the probability of existence of heteroclinic cycles in the phase space network increases both as the number of nodes in the physical network increases, and also as the density of edges in the physical network decreases. However, even in cases where the probability of existence of heteroclinic cycles is very high, there is also a very high chance of the existence of a stable fixed point in the phase space. Thus, the question of the stability of the heteroclinic cycle is important in determining whether or not the heteroclinic cycle, and associated slowing down of trajectories, will be observed in the phase space associated with a randomly generated graph.

There methods we describe in this paper can be used to determine the stability of any specific heteroclinic cycle, but as yet it is not clear how one would determine the likelihood of a heteoclinic cycle to be stable in such a randomly-generated network.

In this work, we consider specific dyanmics for each single node in the directed graph in physical space; specifically, we suppose that there is only an ‘on’ state, and an ‘off’ state. If more general dyanmics are allowed, then other types of heteroclinic cycles can be found in ring graphs [18].

An obvious extension of this work would include different types of coupling and/or different dynamics in the uncoupled nodes. For instance, a situation which might better exemplify neuronal dyanmics could include both inhibitory and excitatory types of connections, and nodes could require a ‘kick’ from an ‘on’ excitatory connection in order to leave a stable zero state. Networks of this type were investigated by Ashwin and Postlethwaite [19], although they made no attempt to classify the possible heteroclinic networks which could occur. Further work on this avenue of investigation is ongoing.

Acknowledgements.
CMP acknowledges support from the Marsden Fund Council from New Zealand Government funding, managed by The Royal Society Te Apārangi.

References

  • Strogatz [2001] S. H. Strogatz, “Exploring complex networks,” nature 410, 268–276 (2001).
  • Kaneko [1989] K. Kaneko, “Spatiotemporal chaos in one-and two-dimensional coupled map lattices,” Physica D: Nonlinear Phenomena 37, 60–82 (1989).
  • Guckenheimer and Holmes [1988] J. Guckenheimer and P. Holmes, “Structurally stable heteroclinic cycles,” in Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 103 (Cambridge University Press, 1988) pp. 189–192.
  • Ashwin and Postlethwaite [2013] P. Ashwin and C. Postlethwaite, “On designing heteroclinic networks from graphs,” Physica D: Nonlinear Phenomena 265, 26–39 (2013).
  • Brin and Stuck [2002] M. Brin and G. Stuck, Introduction to dynamical systems (Cambridge university press, 2002).
  • Ashwin, Rucklidge, and Sturman [2002] P. Ashwin, A. M. Rucklidge, and R. Sturman, “Infinities of stable periodic orbits in systems of coupled oscillators,” Physical Review E 66, 035201 (2002).
  • Ashwin and Sturman [2003] P. Ashwin and R. Sturman, “Decelerating defects and non-ergodic critical behaviour in a unidirectionally coupled map lattice,” Physics Letters A 309, 423–434 (2003).
  • Podvigina [2012] O. Podvigina, “Stability and bifurcations of heteroclinic cycles of type ZZ,” Nonlinearity 25, 1887 (2012).
  • Cauchy [1829] A. L. B. Cauchy, Leçons sur le calcul différentiel (De Bure frères, 1829).
  • Rouché [1866] E. Rouché, Mémoire sur la série de Lagrange (Impr. Impériale, 1866).
  • Kirk and Silber [1994] V. Kirk and M. Silber, “A competition between heteroclinic cycles,” Nonlinearity 7, 1605–1621 (1994).
  • Note [1] For the (N,1)(N,1)-graph case the fixed points can be enumerated directly with the Lucas numbers LnL_{n}, given by L1=1,L2=3,Ln=Ln1+Ln2,n3L_{1}=1,L_{2}=3,L_{n}=L_{n-1}+L_{n-2},n\geq 3. The (N,1)(N,1)-graph has LnL_{n} fixed points, including the configuration with NN zero components.
  • Krupa and Melbourne [2004] M. Krupa and I. Melbourne, “Asymptotic stability of heteroclinic cycles in systems with symmetry. ii,” Proc. Roy. Soc. Edinburgh A 134A, 1177–1197 (2004).
  • Kirk, Postlethwaite, and Rucklidge [2012] V. Kirk, C. Postlethwaite, and A. M. Rucklidge, “Resonance bifurcations of robust heteroclinic networks,” SIAM J. Appl. Dynam. Syst. 11, 1360–1401 (2012).
  • Postlethwaite and Dawes [2010] C. M. Postlethwaite and J. H. Dawes, “Resonance bifurcations from robust homoclinic cycles,” Nonlinearity 23, 621 (2010).
  • Postlethwaite and Rucklidge [2021] C. M. Postlethwaite and A. M. Rucklidge, “Stability of cycling behaviour near a heteroclinic network model of Rock-Paper-Scissors-Lizard-Spock,” Nonlinearity  (2021).
  • Tanzi and Young [2021] M. Tanzi and L.-S. Young, “Existence of physical measures in some excitation–inhibition networks,” Nonlinearity 35, 889 (2021).
  • Buono, Golubitsky, and Palacios [2000] P.-L. Buono, M. Golubitsky, and A. Palacios, “Heteroclinic cycles in rings of coupled cells,” Physica D: Nonlinear Phenomena 143, 74–108 (2000).
  • Ashwin and Postlethwaite [2021] P. Ashwin and C. Postlethwaite, “Excitable networks for finite state computation with continuous time recurrent neural networks,” Biological cybernetics 115, 519–538 (2021).