We consider a coupled, heterogeneous population of relaxation oscillators used to model rhythmic oscillations in the pre-Bötzinger complex. By choosing specific values of the parameter used to describe the heterogeneity, sampled from the probability distribution of the values of that parameter, we show how the effects of heterogeneity can be studied in a computationally efficient manner. When more than one parameter is heterogeneous, full or sparse tensor product grids are used to select appropriate parameter values. The method allows us to effectively reduce the dimensionality of the model, and it provides a means for systematically investigating the effects of heterogeneity in coupled systems, linking ideas from uncertainty quantification to those for the study of network dynamics.
Keywords:heterogeneity; neural oscillators; pre-Bötzinger complex; model reduction; bifurcation; computation
Networks of coupled oscillators have been studied for a number of years [1-7]. One motivation for these studies is that many neurons, when isolated (and possibly injected with a constant current), either periodically fire action potentials [8,9] or periodically move between quiescence and repetitive firing (the alternation being referred to as bursting [10,11]). In either case, the isolated neuron can be thought of as an oscillator. Neurons are typically coupled with many others via either gap junctions  or chemical synapses [13-15]; hence, a group of neurons can be thought of as a network of coupled oscillators.
As an idealisation, one might consider identical oscillators; in which case, the symmetry of the network will often determine its possible dynamics [16,17]. However, natural systems are never ideal, and thus, it is more realistic to consider heterogeneous networks. Also, there is evidence in a number of contexts that heterogeneity within a population of neurons can be beneficial. Examples include calcium wave propagation , the synchronisation of coupled excitable units to an external drive [19,20], and the example we study here: respiratory rhythm generation [13,21].
One simple way to incorporate heterogeneity in a network of coupled oscillators is to select one parameter which affects the individual dynamics of each oscillator and assign a different value to this parameter for each oscillator [3,15,22,23]. Doing this raises natural questions such as from which distribution should these parameter values be chosen, and what effect does this heterogeneity have on the dynamics of the network?
Furthermore, if we want to answer these questions in the most computationally efficient way, we need a procedure for selecting a (somehow) optimal representative set of parameter values from this distribution. In this paper, we will address some of these issues.
In particular, we will show how - given the distribution(s) of the parameter(s) describing the heterogeneity - the representative set of parameter values can be chosen so as to accurately incorporate the effects of the heterogeneity without having to fully simulate the entire large network of oscillators.
We investigate one particular network of coupled relaxation oscillators, derived from a model of the pre-Bötzinger complex [13,14,24], and show how the heterogeneity in one parameter affects its dynamics. We also show how heterogeneity in more than one parameter can be incorporated using either full or sparse tensor product grids in parameter space.
Our approach thus creates a bridge between computational techniques developed in the field of uncertainty quantification [25,26] involving collocation and sparse grids on the one hand, and network dynamics on the other. It also helps us build accurate, reduced computational models of large coupled neuron populations.
One restriction of our method is that it applies only to states where all oscillators are synchronised (in the sense of having the same period) or at a fixed point. Synchronisation of this form typically occurs when the strength of coupling between oscillators is strong enough to overcome the tendency of non-identical oscillators to desynchronise due to their disparate frequencies [2,3,27] and is often the behaviour of interest [6,13,14,23].
We present the model in Section 2 and show how to efficiently include parameter heterogeneity in Section 3. In Section 4, we explore how varying heterogeneity modifies bifurcations and varies the period of the collective oscillation. Sections 5 and 6 show how to deal with two and more, respectively, heterogeneous parameters. We conclude in Section 7.
2 The model
Our illustrative example is a network of model neurons thought to describe at some level the dynamics of the pre-Bötzinger complex, governed by the following equations:
as considered in the work of Rubin and Terman . Here, is the membrane potential of cell i, and is a channel state variable for neuron i that is governing the inactivation of persistent sodium. Equations 1 and 2 were derived from the model in the works of Butera et al.[13,24] by blocking currents responsible for action potentials. A similar model with was considered in the work of Rubin , and Dunmyre and Rubin  considered synchronisation in the case , where one of the neurons was quiescent, another was tonically firing, and the third one could be either quiescent, tonically firing or bursting. The neurons are all-to-all coupled via the term ; when the neurons are uncoupled. The various functions involved in the model equations are the following:
The functions and are a standard part of the Hodgkin-Huxley formalism , and synaptic communication is assumed to act instantaneously through the function . The parameter values we use initially are and .
Note that the synaptic coupling is excitatory. These parameters are the same as that used in the work of Rubin and Terman  except that they  used and , and their function had a more rapid transition from approximately 0 to 1 as V was increased. These changes in parameter values were made to speed up the numerical integration of Equations 1 and 2, and the methods presented here do not depend on the particular values of these parameters.
If the values of the applied current are taken from a uniform distribution on the interval , the behaviour is as shown in Figure 1. After a transient, we see a synchronous behaviour, i.e. all neurons oscillate periodically with the same period, although the heterogeneity in the means that each neuron follows a slightly different periodic orbit in its own phase space. (Because spiking currents have been removed in the derivation of Equations 1 and 2, these oscillations are interpreted as burst envelopes, i.e. neuron i is assumed to be spiking when is high and quiescent when is low.) It is this stable synchronous periodic behaviour that is of interest: In what parameter regions does it exist, and how does the period vary as parameters are varied? Butera et al. observed that including parameter heterogeneity in a spiking model for the pre-Bötzinger complex, it increased both the range of parameters over which bursting occurred and the range of burst frequencies (this being functionally advantageous for respiration), and this was the motivation for the study of Rubin and Terman .
Fig. 1. Solutions of Equations 1 and 2. These are the solutions when the values are uniformly sampled from a uniform distribution on . Top: as functions of time. Bottom: as functions of time . Different line colours correspond to different neurons (only every 10th neuron is shown).
3 Managing heterogeneity
3.1 The continuum limit
The key observation behind our approach can be seen in Figure 2, where we plot the and as functions of at one instant in time. Once the neurons have synchronised, values (and and any smooth functions of these variables) appear to vary smoothly when plotted as a function of the heterogeneous parameter . This is also the case when the values are chosen randomly from the interval rather than uniformly (not shown). This suggests that in the limit of , at any instant in time, V and h will be smooth functions of the continuous variable . We now consider this case where is a continuous random variable with a uniform density on the interval . We parametrise as , where the probability density function for μ is as follows:
Fig. 2. Solutions of Equations 1 and 2 at one instant in time. (top) and (bottom) as functions of , . This shows a state where all neurons are active (see Figure 1). If the network was switching from active to quiescent or vice versa, there would be a steep ‘front’ where the changed rapidly with i although they would still form a continuous curve.
and become and , respectively, and the points in Figure 2 ‘fill in’ to form continuous functions. In the given example, we had and . Thus, the ordinary differential equations (ODEs) 1 and 2 become the following:
The results for should provide a good approximation to the behaviour seen when N is large but finite, which is the realistic (although difficult to simulate) case. The continuum limit presented in this section was first introduced by Rubin and Terman , but their contribution was largely analytical, whereas ours will be largely numerical.
3.2 Stochastic Galerkin
One approach to studying Equations 9 and 11, motivated by techniques developed in the context of uncertainty quantification [25,26], is to expand the functions and in orthogonal polynomials in μ, with the choice of particular polynomials determined by the probability density of μi.e. the distribution of the heterogeneous parameter. For the uniform density , one would choose Legendre polynomials, written as follows:
where is the ith Legendre polynomial; this is known as a ‘polynomial chaos’ expansion . Substituting Equation 12 into Equation 9, multiplying both sides by and integrating over μ between −1 and 1, the orthogonality properties of Legendre polynomials with uniform weight allows one to obtain the ODE satisfied by . Similarly, one can use Equation 10 to obtain the ODEs governing the dynamics of . Having solved (a truncated set of) these ODEs, one could reconstruct and using Equation 12. This is referred to as the stochastic Galerkin method . However, the integrals just mentioned cannot be performed analytically. They must be calculated numerically at each time step in the integration of the ODEs for and ; this is computationally intensive. Note that the optimal choice of orthogonal polynomials is determined by the distribution of the heterogeneous parameter: for a uniform distribution, we use Legendre polynomials; for other distributions, other families of orthogonal polynomials are used [25,26].
3.3 Stochastic collocation
An alternative, motivated by the stochastic collocation method , is to simply discretise in the μ direction, obtaining N different values, and then solve Equations 9 and 10 at each of the , using the values of to approximate the integral in Equation 11.
It is important to realize that the number (N) of neurons simulated in this approach may well be much smaller than the number of neurons in the ‘true’ system, considered to be in the thousands. Notice also that these neurons are ‘mathematically’ coupled to one another via the discretisation of the integral (Equation 11), which is an approximation of the continuum limit.
Using the values of to approximate the integral in Equation 11, we are in fact including the influence of all other neurons (an infinite number of them in the continuum limit), not just those that we have retained in our reduced approximation. We now examine how different discretisation schemes affect several different calculations.
3.3.1 Period calculation
Firstly, we consider the period of the collective oscillations seen in Figure 1. The analogue of finite differences, or the method of lines, is to uniformly discretise the interval into N values, , and to solve Equations 9 and 10 at each of the . Defining for , we approximate the integral in Equation 11 using the composite midpoint rule:
which, after defining , is nothing more than the sum in Equation 3, where . To show convergence of the calculation of the period with N, we plot the error in Figure 3 with red stars; the error is defined to be the absolute value of the difference between the calculated period and the true period (defined below). We see that the error scales as as expected from numerical analysis . (All numerical integration was performed using Matlab’s ode113 with an absolute tolerance of 10−10 and a relative tolerance of 10−12.)
Fig. 3. Error in the calculated period of the synchronised oscillators. Error in the calculated period of the synchronised oscillators as a function of the number of neurons simulated (N) for the midpoint rule (red stars) and the Gaussian quadrature (blue circles). Also shown (dashed) is a line corresponding to error approximately , to guide the eye.
However, by choosing non-uniformly spaced values of , we can evaluate the integral in Equation 13 much more accurately. (By ‘more accurately’, we mean either that for a fixed N, using the non-uniformly spaced will result in a smaller error than that obtained using uniform spacing, or that to obtain a fixed accuracy, using non-uniform spacing will require a smaller N than that needed for uniform spacing.) Specifically, for a fixed N, if we choose to be the ith root of , where is the Nth Legendre polynomial, normalised so that , and the weights
then the Gauss-Legendre quadrature rule  is
Convergence of the error in the period with N is shown in Figure 3 (blue circles), where we see the very rapid convergence expected from a spectral method. For , the error in the period calculation using this method is dominated by errors in the numerical integration of the Equations 9 and 10 in time, rather than in the approximate evaluation of the integral in Equation 11. (The true period was calculated using the Gauss-Legendre quadrature with N significantly larger than 104 and is approximately 8.040104851819.) The rapid convergence of the Gauss-Legendre quadrature is a consequence of the fact that the function is a sufficiently smooth function of μ (see Figure 2). This smoothness will arise only when the oscillators become fully synchronised.
3.3.2 Hopf bifurcations
By decreasing or increasing (the mean of the ), we find that the oscillations in Figure 1 terminate in Hopf bifurcations. We now examine the effects of the different discretisations mentioned on the detection of these Hopf bifurcations. In Figure 4, we see the error in calculating the value of at which the upper Hopf bifurcation occurs as a function of N, the number of points used, for the two different schemes (the true value, again calculated using the Gauss-Legendre quadrature with a large N, is approximately ).
Fig. 4. Error in calculation error of the value of where upper Hopf bifurcation occurs. Error in the calculation of the value of at which the upper Hopf bifurcation occurs using the midpoint rule (red stars) and the Gaussian quadrature (blue circles). Other parameters: , . The midpoint rule error decays as . For , the error using the Gaussian quadrature is dominated by the precision with which the Hopf bifurcation can be located, hence the plateau.
The expected behaviour (very rapid convergence for Gaussian quadrature and the error scaling as for the composite midpoint rule) is seen (as compared with Figure 3). Figure 5 shows a similar calculation but for the lower Hopf bifurcation which occurs at . Several interesting points in contrast with the results in Figure 4 are evident: The error in the composite midpoint rule appears to decay as , while the error using the Gaussian quadrature appears to decay as . The reason for these differences is not clear.
Fig. 5. Error in calculation error of the value of where lower Hopf bifurcation occurs. Error in calculation of the value of at which the lower Hopf bifurcation occurs using the midpoint rule (red stars) and the Gaussian quadrature (blue circles). The error for the midpoint rule appears to decay as . Other parameters: , .
In this section, we have shown that a judicious choice of the values of the heterogeneous parameter, combined with a scheme for the Gaussian quadrature, allows us to calculate quantities of interest (such as the period of oscillation and the parameter value at which a Hopf bifurcation occurs) much more parsimoniously than a naive implementation of uniformly spaced values for a uniform distribution. Effectively, we have simulated the behaviour of a large network of oscillators by actually simulating a much smaller one, carefully choosing which oscillators to simulate (and how to couple them so as to also capture the effect of the omitted ones).
Having demonstrated this, we now fix and use the quadrature rule given in Equation 15. Note that our discretisation in μ can be thought of in two different ways. Firstly, we can consider the continuum limit () as the true system, whose dynamics will be close to the real system which consists of a large number of neurons. Our scheme is then an efficient way of simulating this true system. The other interpretation is that the true system consists of a large, finite number of neurons with randomly distributed parameter(s), and our scheme is a method for simulating such a system but using far fewer oscillators.
In the next section, we investigate the effects of varying , and . In a later section, we consider more than one heterogeneous parameter and show how tensor product grids and sparse tensor product grids can be used to accurately calculate the effects of further, independently distributed, heterogeneities.
4 The effects of heterogeneity
4.1 A single neuron
In order to investigate the effects of heterogeneity, we first examine a single uncoupled neuron (i.e. and ). The behaviour as is varied as shown in Figure 6 (left panel). For this range of , there is always one fixed point, but it undergoes two Hopf bifurcations as is varied, leading to a family of stable periodic orbits. The period decreases monotonically with increasing . The lower Hopf bifurcation results in a canard periodic solution  which very rapidly increases in amplitude as is increased. This is related to the separation of time scales between the V dynamics (fast) and the h dynamics (slow). In the left panel of Figure 6, we see that some of the neurons in the network whose behaviour is shown in Figure 1 would be quiescent when uncoupled, while most would be periodically oscillating.
Fig. 6. The bifurcation behaviour, V as functions of and period of the stable periodic orbit. Left: the bifurcation behaviour of a single uncoupled neuron (, ). Top left: voltage V at a fixed point (solid, stable; dashed, unstable) and the maximum and minimum of V over one period of oscillation (circles), as a function of . Bottom left: period of the stable periodic orbit for a single uncoupled neuron. The apparent discontinuity in the periodic orbit towards low is because of the canard nature of the oscillations (mentioned in the text). Right: the bifurcation behaviour of a single self-coupled neuron (, ). Top right: voltage V at a fixed point (solid stable, dashed unstable) and the maximum and minimum of V over one period of oscillation (circles), as a function of . Bottom right: period of the stable periodic orbit for a single self-coupled neuron.
The behaviour in the left panel of Figure 6 can also be understood by looking at the phase plane for different values of - see Figure 7. The behaviour of one self-coupled neuron (, ) is shown in Figure 6 (right panel). We see that the main effect of self-coupling is to move both Hopf bifurcations to lower values of .
Fig. 7. The phase plane for a single uncoupled neuron. h-nullcline (dashed, on which ) and the V-nullclines (circles, on which ) for (top to bottom). Also shown (solid) is the stable periodic orbit that exists when .
4.2 A coupled population of neurons
Now, consider a coupled heterogeneous population with neurons. Parameter values are and . (Note that if , we recover the results for one self-coupled neuron.) The results from varying are shown in Figure 8. Comparing with the right panel of Figure 6, we see that including heterogeneity widens the range of values for which oscillations occur. The periodic orbit cannot be followed below , as more complex oscillations than purely periodic occur (not shown), as discussed below. Note that the mean voltage at the fixed point is easily calculated as , where is the steady state value of neuron i, and the variance of the ’s is simply . (Recall that the weights are given in Equation 14.)
Fig. 8. The bifurcation behaviour of a heterogeneous population. Top: mean voltage at a fixed point (solid stable, dashed unstable), mean ± one standard deviation (dotted), and the maximum and minimum of the mean of V over one period of oscillation (circles), as a function of . Bottom: period of the stable periodic orbit. , , .
To better understand these results, we can follow the Hopf bifurcations as two parameters are varied. Figure 9 (top) shows the two curves of Hopf bifurcations in the , plane for . Increasing the ‘spread’ of the heterogeneity, i.e. increasing , increases the range of values of for which periodic oscillations are possible (between the Hopf bifurcations), but there may not necessarily exist stable periodic orbits over the entire range. For larger than about 6, i.e. for very heterogeneous neurons, the synchronous behaviour created in the rightmost Hopf bifurcation shown in Figure 9 (top) breaks up as is decreased at constant , leading to complex oscillations (not shown). The break-up of the synchronous behaviour always involves the neurons with the lowest values of μ, i.e. the lowest values of . The curve in Figure 9 (top) where synchronous behaviour breaks up was found by slowly decreasing at constant until the break-up was observed. In principle, it could be found by numerical continuation of the stable periodic orbit created in the rightmost Hopf bifurcation, monitoring the orbit’s stability.
Fig. 9. Hopf bifurcation curves and period of the stable periodic orbit for three different values of . Top: Hopf bifurcation curves (solid) and the curve on which the periodic orbit created in the rightmost Hopf bifurcation loses stability (circles, found from direct simulation). Bottom: period of the stable periodic orbit for three different values of , the spread of the heterogeneity. For , the curves are terminated at low when the periodic orbit loses stability to a more complex oscillation. , .
Now, consider varying and for a fixed . As seen in Figure 10, the range of values of for which oscillations may arise decreases at increases (both Hopf bifurcations move to lower values of ), and for small (i.e. weak coupling), the neurons are no longer synchronous, due to break-up as discussed. The conclusion is that, in order to obtain robust synchronous oscillations, we need moderate to large coupling () and a not-too-heterogeneous population ( not too large). This is perhaps not surprising, but our main point here is to demonstrate how the computation of the effects of heterogeneity can easily be accelerated. We now consider more than one heterogeneous parameter.
Fig. 10. Hopf bifurcation curves and period of the stable periodic orbit for three different values of . Top: Hopf bifurcation curves (solid) and the curve on which the periodic orbit created in the rightmost Hopf bifurcation loses stability (circles, obtained by direct simulation). Synchronous oscillations occur only above the curve shown with red circles. Bottom: period of the stable periodic orbit for three different values of . The curve for is terminated at low when the periodic orbit loses stability to a more complex oscillation. , .
5 Two heterogeneous parameters
Now, consider the case where both and for each neuron are randomly (independently) distributed. We keep the uniform distribution for the , choosing , so that the come from a uniform distribution on . We choose the from a normal distribution with a mean of 2.8, and standard deviation σ and set . We keep 10 points in the μ direction and use the values of and from above to perform integration in the μ direction. The quantity M refers to the number of different values chosen, and we thus simulate 10M appropriately as coupled neurons.
The values of and for the different neurons are selected based on the tensor product of the vectors formed from and . Similarly, the weights in a sum of the form (Equation 15) will be formed from a tensor product of the associated with the direction and those associated with the .
Keeping the Gauss-Legendre rule in the μ direction, this gives
The simplest approach to this integral is the Monte Carlo method , where we simply randomly choose M values of λ from the unit normal distribution and calculate an approximation to the integral as the following:
Here, the weights in the λ direction are all equal to . An example of the and for is shown in Figure 11 (top). Another approach is to transform the integral to one over and use the composite midpoint rule on that new variable. Specifically, if we define
i.e.Q is the cumulative density function for λ, and then for a general function f, the integral
can be written as
Thus, we define
for and use the approximation (Equation 19). An example of the and for is shown in Figure 11 (middle). It is better still to use the Gaussian quadrature (specifically, the Gauss-Hermite quadrature) in the λ direction. We approximate the integral
Fig. 11. Examples of the heterogeneity grid values of and for . Top: the values are randomly chosen from a unit normal distribution. Middle: the values are chosen by uniformly sampling the inverse cumulative distribution function of a unit normal distribution. Bottom: the values are the roots of , the 15th Hermite polynomial. In all cases, the are roots of , the 10th Legendre polynomial.
An example of the and for is shown in Figure 11 (bottom).
The result of using these three different methods to allocate the (and thus, to select the reduced number of appropriately coupled neurons we simulate) is shown in Figure 12. This figure shows the error in the calculated period as M is varied. (The true period was calculated using the Gauss-Hermite quadrature with a large M in the direction.)
Fig. 12. Error in the calculated period using three different methods (see text) for . The dashed lines, drawn to guide the eye, have slopes (upper) and −1 (lower). For the Monte Carlo simulations, the average of 10 calculations for each M is shown.
We see that as expected, the Gauss-Hermite quadrature performs the best, with the error saturating between and . (Recalling that we are using 10 points in the μ direction, this is consistent with the idea that roughly the same number of points should be used in each random direction.) Using the Monte Carlo method, i.e. randomly choosing, the gives convergence that scales as . Uniformly sampling the inverse cumulative distribution function gives an error that appears to scale as . This is at variance with the expected scaling of for the composite midpoint rule applied to a function with a bounded second derivative, but the inverse CDF of a normal distribution (i.e.) does not have a bounded second derivative, and an error analysis of Equation 22 (not shown) predicts a scaling of , as observed.
6 Sparse grids
The process described above can obviously be generalised to more than two randomly, but independently, distributed parameters. The distribution of each parameter determines the type of quadrature which should be used in that direction, and the parameter values and weights are formed from tensor products of the underlying one-dimensional rules. However, the curse of dimensionality will restrict how many random parameters can be accurately sampled. If we use N points in each of D random dimensions, the number of neurons we need to simulate is .
One way around this problem is to use sparse grids [33,34], as introduced by Smolyak . The basic idea is to use sparse tensor products, chosen in such a way as to have similar accuracy to the corresponding full tensor product, but with fewer grid points, and thus (in our case) fewer neurons to simulate. A general theory exists [33,34], but to illustrate the idea, suppose we have two uncorrelated random parameters, each is distributed uniformly between −1 and 1. A full tensor product for the Gauss-Legendre quadrature using 11 points in each direction is shown in Figure 13.
Fig. 13. Full tensor product using 11 points in each direction (121 points in total). The points are the roots of , the 11th Legendre polynomial.
To form a two-dimensional sparse grid using the Gauss-Legendre quadrature, we first write the one-dimensional integration rule for integrating a function f as
Fig. 14. Grids for rules and . Top: blue circles: the grid for rule (i.e. level 2 in 2 spatial dimensions) using Gauss-Legendre quadrature. Red crosses: grid corresponding to (one point horizontally, 7 vertically). Black dots: grid corresponding to (3 points both horizontally and vertically). The three black dots on the y-axis correspond to , while the three black dots on the x-axis correspond to . Bottom: the grid for rule (i.e. level 3 in 2 spatial dimensions). Rule has 21 grid points, and rule has 73.
Rules such as these can be constructed for an arbitrary number of spatial dimensions, using a variety of quadrature rules (and possibly different rules in different dimensions). Their advantage becomes apparent as the dimension of the space to be integrated over (or in our case, the number of heterogeneous parameters) is increased. To illustrate this, we consider as an example the model, Equations 1 and 2 with uniformly spread between 17.5 and 32.5; the uniformly spread between 2.55 and 3.05; uniformly spread between −1 and 1; and uniformly spread between 49 and 51, i.e. 4 independent random dimensions. A comparison of the error in calculating the period of collective oscillation using full and sparse grids is shown in Figure 15.
Fig. 15. Error in calculation of period. This happens when four distinct parameters are simultaneously heterogeneous (independently of one another) for both full and sparse grids. See text for details. N is the number of neurons simulated.
We see that for fixed N, the sparse grid calculation is approximately two orders or magnitude more accurate than the full grid - implying, in turn, that the way we select the reduced number of neurons we retain to simulate the full system is critical. This relative advantage is expected to increase as the number of distributed parameters increases. As an example of the growth in the number of grid points, a level 6 calculation in 10 dimensions uses fewer than one million points, and the resulting system can be easily simulated on a desktop PC. (Note that the grid points and weights are calculated before the numerical integration starts, so the computational cost in producing data like that shown in Figure 15 is almost entirely due to numerical integration of the ODEs, which is proportional to the number of grid points, i.e. neurons, used.)
In this paper, we have presented and demonstrated the use of a computationally efficient method for systematically investigating the effects of heterogeneity in the parameters of a coupled network of neural oscillators. The method constitutes a model reduction approach: By only considering oscillators with parameter values given by roots of families of orthogonal polynomials (Legendre, Hermite, …), we can use the Gaussian quadrature to accurately evaluate the term coupling the oscillators, which can be thought of as the discretisation of an integral over the heterogeneous dimension(s).
Effectively, we are simulating the behaviour of an infinite number of oscillators by only simulating a small number of judiciously selected ones, modifying appropriately the way they are coupled. When the oscillators are synchronised, or at a fixed point, the function to be integrated is a smooth function of the heterogeneous parameter(s), and thus, convergence is very rapid. The technique is general (although subject to the restriction immediately above) and can be used when there is more than one heterogeneous parameter, via full or sparse tensor products in parameter space. For a given level of accuracy, we are simulating far fewer neurons than might naively be expected. The emphasis here has been on computational efficiency rather than a detailed investigation of parameter dependence.
The model we considered involved coupling only through the mean of a function, s, of the variable which, in the limit , can be thought of as an integral or, more generally, as a functional of . Thus, the techniques demonstrated here could also be applied to networks coupled through terms which, in the continuum limit, are integrals or functions of integrals. A simple example is diffusive coupling ; another possibility is coupling which is dependent upon the correlation between some or all of the variables. As mentioned, the technique will break down once the oscillators become desynchronised, as the dependence of state on parameter(s) will no longer be smooth. However, if the oscillators form several clusters [14,36], it may be possible to apply the ideas presented here to each cluster, as the dependence of state on parameter(s) within each cluster should still be smooth. Ideally, this reparametrisation would be done adaptively as clusters form, in the same way that algorithms for numerical integration adapt as the solution varies . Alternatively, if a single oscillator ‘breaks away’ , the methods presented here could be used on the remaining synchronous oscillators, with the variables describing the state of the rogue oscillator also fully resolved. More generally, there are systems in which it is not necessarily the state of an oscillator that is a smooth function of the heterogeneous parameter, but the parameters describing the distribution of states[37,38], and the ideas presented here could also be useful in this case.
The primary study with which we should compare our results is that of Rubin and Terman . They considered essentially the same model as Equations 1 and 2 but with heterogeneity only in the and, taking the continuum limit, referred to the curve in space describing the state of the neurons at any instant in time as a ‘snake’. By making various assumptions, such as an infinite separation of time scales between the dynamics of the and the , and that the dynamics of the in both the active and quiescent phases is linear, they derived an expression for the snake at one point in its periodic orbit and showed that such a snake is unique and stable. They also estimated the parameter values at which the snake ‘breaks’ and some oscillators lose synchrony. In contrast with their mainly analytical study, ours is mostly numerical and thus does not rely on any of the assumptions just mentioned. Using the techniques presented here, we were able to go beyond the work of Rubin and Terman, exploring parameter space.
Our approach can be thought of as a particular parametrisation of this snake, which takes into account the probability density of the heterogeneity parameter(s); we also showed a systematic way of extending this one-dimensional snake to two and higher dimensions. Another paper which uses some of the same ideas as presented here is that of Laing and Kevrekidis . There, the authors considered a finite network of coupled oscillators and used a polynomial chaos expansion of the same form as Equation 12. However, instead of integrating the equations for the polynomial chaos coefficients directly, they used projective integration  to do so, in an ‘equation-free’ approach  in which the equations satisfied by the polynomial chaos coefficients are never actually derived. They also chose the heterogeneous parameter values randomly from a prescribed distribution and averaged over realisations of this process in order to obtain ‘typical’ results. Similar ideas had been explored earlier by Moon et al., who considered a heterogeneous network of phase oscillators.
Assisi et al. considered a heterogeneous network of coupled neural oscillators, deriving equations of similar functional form to Equations 9 and 11. Their approach was to expand the variables in a way similar to Equation 12 but using a small number of arbitrarily chosen ‘modes’ rather than orthogonal polynomials. Their choice of modes, along with the fact that their neural model consisted of ODEs with polynomial right hand sides, allowed them to analytically derive the ODEs satisfied by the coefficients of the modes. This approach allowed them to qualitatively reproduce some of the behaviour of the network such as the formation of two clusters of oscillators. However, in the general case modes should be chosen as orthogonal polynomials, the specific forms of which are determined by the distribution of the heterogeneous parameter(s) [25,26].
The network we considered was all-to-all coupled, and the techniques presented should be applicable to other similar systems. The only requirement is that the relationship between the heterogeneity parameter(s) and the state of the system (possibly after transients) be smooth (or possibly piecewise smooth). An interesting extension is the case when the network under consideration is not all-to-all. Then, the effects of degree distribution may affect the dynamics of individual oscillators [38,41,42], and if we have a way of parameterising this type of heterogeneity, it might be possible to apply the ideas presented here to such networks. Degree distribution is a discrete variable, and corresponding families of orthogonal polynomials exist for a variety of discrete random variables [25,26].
The authors declare that they have no competing interests.
CRL, YZ and BS performed calculations relating to the results presented. CRL and IGK wrote the manuscript. All authors read and approved the final manuscript.
The works of CRL and BS were supported by the Marsden Fund Council from government funding, administered by the Royal Society of New Zealand. The works of IGK and YZ were supported by the AFOSR and the US DOE (DE-SC0005176 and DE-SC00029097).
Physica D, Nonlinear Phenom 1991, 49(3):387-475. Publisher Full Text
Physica D, Nonlinear Phenom 1991, 52(2-3):293-331. Publisher Full Text
Physica D, Nonlinear Phenom 2008, 237(2):207-215. Publisher Full Text
Rev Mod Phys 2005, 77:137-185. Publisher Full Text
Int J Bifurc Chaos 2000, 10(6):1171-1266. Publisher Full Text
SIAM J Appl Dyn Syst 2008, 7:1101. Publisher Full Text
SIAM J Appl Dyn Syst 2002, 1:146-174. Publisher Full Text
Phys Rev E 1993, 48(6):4810-4814. Publisher Full Text
J Nonlinear Sci 1992, 2:69-108. Publisher Full Text
Philos Trans R Soc A, Math Phys Eng Sci 2010, 368(1933):5619-5632. Publisher Full Text
J Comput Phys 2003, 187:137-167. Publisher Full Text
SIAM J Appl Dyn Syst 2010, 9:154-187. Publisher Full Text
SIAM Rev 2008, 50:67. Publisher Full Text
J Nonlinear Sci 2002, 12(4):319-345. Publisher Full Text
Numer Algorithms 1998, 18(3):209-232. Publisher Full Text
Adv Comput Math 2000, 12:273-288. Publisher Full Text
Physica D, Nonlinear Phenom 1995, 89(1-2):169-183. Publisher Full Text
Int J Bifurc Chaos 2006, 16:21-37. Publisher Full Text
Comput Sci Eng 2005, 7(3):16-23. Publisher Full Text
Int J Bifurc Chaos 2010, 20(11):3673-3688. Publisher Full Text