Chimeras in phase oscillator networks locally coupled through an auxiliary field: Stability and bifurcations.

We study networks in the form of a lattice of nodes with a large number of phase oscillators and an auxiliary variable at each node. The only interactions between nodes are nearest-neighbor. The Ott/Antonsen ansatz is used to derive equations for the order parameters of the phase oscillators at each node, resulting in a set of coupled ordinary differential equations. Chimeras are steady states of these equations, and we follow them as parameters are varied, determining their stability and bifurcations. In two-dimensional domains, we find that spiral wave chimeras and rotating waves have significantly different properties than those in networks with nonlocal coupling.

Periodic solutions in next generation neural field models.

We consider a next generation neural field model which describes the dynamics of a network of theta neurons on a ring. For some parameters the network supports stable time-periodic solutions. Using the fact that the dynamics at each spatial location are described by a complex-valued Riccati equation we derive a self-consistency equation that such periodic solutions must satisfy. We determine the stability of these solutions, and present numerical results to illustrate the usefulness of this technique. The generality of this approach is demonstrated through its application to several other systems involving delays, two-population architecture and networks of Winfree oscillators.

Chimeras on a ring of oscillator populations.

Chimeras occur in networks of coupled oscillators and are characterized by coexisting groups of synchronous oscillators and asynchronous oscillators. We consider a network formed from N equal-sized populations at equally spaced points around a ring. We use the Ott/Antonsen ansatz to derive coupled ordinary differential equations governing the level of synchrony within each population and describe chimeras using a self-consistency argument. For N=2 and 3, our results are compared with previously known ones. We obtain new results for the cases of 4,5,…,12 populations and a numerically based conjecture resulting from the behavior of larger numbers of populations. We find macroscopic chaos when more than five populations are considered, but conjecture that this behavior vanishes as the number of populations is increased.

Chimeras on annuli.

Chimeras occur in networks of coupled oscillators and are characterized by the coexistence of synchronous and asynchronous groups of oscillators in different parts of the network. We consider a network of nonlocally coupled phase oscillators on an annular domain. The Ott/Antonsen ansatz is used to derive a continuum level description of the oscillators' expected dynamics in terms of a complex-valued order parameter. The equations for this order parameter are numerically analyzed in order to investigate solutions with the same symmetry as the domain and chimeras which are analogous to the "multi-headed" chimeras observed on one-dimensional domains. Such solutions are stable only for domains with widths that are neither too large nor too small. We also study rotating waves with different winding numbers, which are similar to spiral wave chimeras seen in two-dimensional domains. We determine ranges of parameters, such as the size of the domain for which such solutions exist and are stable, and the bifurcations by which they lose stability. All of these bifurcations appear subcritical.

Learning emergent partial differential equations in a learned emergent space.

We propose an approach to learn effective evolution equations for large systems of interacting agents. This is demonstrated on two examples, a well-studied system of coupled normal form oscillators and a biologically motivated example of coupled Hodgkin-Huxley-like neurons. For such types of systems there is no obvious space coordinate in which to learn effective evolution laws in the form of partial differential equations. In our approach, we accomplish this by learning embedding coordinates from the time series data of the system using manifold learning as a first step. In these emergent coordinates, we then show how one can learn effective partial differential equations, using neural networks, that do not only reproduce the dynamics of the oscillator ensemble, but also capture the collective bifurcations when system parameters vary. The proposed approach thus integrates the automatic, data-driven extraction of emergent space coordinates parametrizing the agent dynamics, with machine-learning assisted identification of an emergent PDE description of the dynamics in this parametrization.

Collective states in a ring network of theta neurons.

We consider a ring network of theta neurons with non-local homogeneous coupling. We analyse the corresponding continuum evolution equation, analytically describing all possible steady states and their stability. By considering a number of different parameter sets, we determine the typical bifurcation scenarios of the network, and put on a rigorous footing some previously observed numerical results.

Chimeras with uniformly distributed heterogeneity: Two coupled populations.

Chimeras occur in networks of two coupled populations of oscillators when the oscillators in one population synchronize while those in the other are asynchronous. We consider chimeras of this form in networks of planar oscillators for which one parameter associated with the dynamics of an oscillator is randomly chosen from a uniform distribution. A generalization of the previous approach [Laing, Phys. Rev. E 100, 042211 (2019)2470-004510.1103/PhysRevE.100.042211], which dealt with identical oscillators, is used to investigate the existence and stability of chimeras for these heterogeneous networks in the limit of an infinite number of oscillators. In all cases, making the oscillators more heterogeneous destroys the stable chimera in a saddle-node bifurcation. The results help us understand the robustness of chimeras in networks of general oscillators to heterogeneity.

Interpolating between bumps and chimeras.

A "bump" refers to a group of active neurons surrounded by quiescent ones while a "chimera" refers to a pattern in a network in which some oscillators are synchronized while the remainder are asynchronous. Both types of patterns have been studied intensively but are sometimes conflated due to their similar appearance and existence in similar types of networks. Here, we numerically study a hybrid system that linearly interpolates between a network of theta neurons that supports a bump at one extreme and a network of phase oscillators that supports a chimera at the other extreme. Using the Ott/Antonsen ansatz, we derive the equation describing the hybrid network in the limit of an infinite number of oscillators and perform bifurcation analysis on this equation. We find that neither the bump nor chimera persists over the whole range of parameters, and the hybrid system shows a variety of other states such as spatiotemporal chaos, traveling waves, and modulated traveling waves.

Global and local reduced models for interacting, heterogeneous agents.

Large collections of coupled, heterogeneous agents can manifest complex dynamical behavior presenting difficulties for simulation and analysis. However, if the collective dynamics lie on a low-dimensional manifold, then the original agent-based model may be approximated with a simplified surrogate model on and near the low-dimensional space where the dynamics live. Analytically identifying such simplified models can be challenging or impossible, but here we present a data-driven coarse-graining methodology for discovering such reduced models. We consider two types of reduced models: globally based models that use global information and predict dynamics using information from the whole ensemble and locally based models that use local information, that is, information from just a subset of agents close (close in heterogeneity space, not physical space) to an agent, to predict the dynamics of an agent. For both approaches, we are able to learn laws governing the behavior of the reduced system on the low-dimensional manifold directly from time series of states from the agent-based system. These laws take the form of either a system of ordinary differential equations (ODEs), for the globally based approach, or a partial differential equation (PDE) in the locally based case. For each technique, we employ a specialized artificial neural network integrator that has been templated on an Euler time stepper (i.e., a ResNet) to learn the laws of the reduced model. As part of our methodology, we utilize the proper orthogonal decomposition (POD) to identify the low-dimensional space of the dynamics. Our globally based technique uses the resulting POD basis to define a set of coordinates for the agent states in this space and then seeks to learn the time evolution of these coordinates as a system of ODEs. For the locally based technique, we propose a methodology for learning a partial differential equation representation of the agents; the PDE law depends on the state variables and partial derivatives of the state variables with respect to model heterogeneities. We require that the state variables are smooth with respect to model heterogeneities, which permit us to cast the discrete agent-based problem as a continuous one in heterogeneity space. The agents in such a representation bear similarity to the discretization points used in typical finite element/volume methods. As an illustration of the efficacy of our techniques, we consider a simplified coupled neuron model for rhythmic oscillations in the pre-Bötzinger complex and demonstrate how our data-driven surrogate models are able to produce dynamics comparable to the dynamics of the full system. A nontrivial conclusion is that the dynamics can be equally well reproduced by an all-to-all coupled and by a locally coupled model of the same agents.

Effects of degree distributions in random networks of type-I neurons.

We consider large networks of theta neurons and use the Ott-Antonsen ansatz to derive degree-based mean-field equations governing the expected dynamics of the networks. Assuming random connectivity, we investigate the effects of varying the widths of the in- and out-degree distributions on the dynamics of excitatory or inhibitory synaptically coupled networks and gap junction coupled networks. For synaptically coupled networks, the dynamics are independent of the out-degree distribution. Broadening the in-degree distribution destroys oscillations in inhibitory networks and decreases the range of bistability in excitatory networks. For gap junction coupled neurons, broadening the degree distribution varies the values of parameters at which there is an onset of collective oscillations. Many of the results are shown to also occur in networks of more realistic neurons.

Dynamics of Structured Networks of Winfree Oscillators.

Winfree oscillators are phase oscillator models of neurons, characterized by their phase response curve and pulsatile interaction function. We use the Ott/Antonsen ansatz to study large heterogeneous networks of Winfree oscillators, deriving low-dimensional differential equations which describe the evolution of the expected state of networks of oscillators. We consider the effects of correlations between an oscillator's in-degree and out-degree, and between the in- and out-degrees of an "upstream" and a "downstream" oscillator (degree assortativity). We also consider correlated heterogeneity, where some property of an oscillator is correlated with a structural property such as degree. We finally consider networks with parameter assortativity, coupling oscillators according to their intrinsic frequencies. The results show how different types of network structure influence its overall dynamics.

A permutation method for network assembly.

We present a method for assembling directed networks given a prescribed bi-degree (in- and out-degree) sequence. This method utilises permutations of initial adjacency matrix assemblies that conform to the prescribed in-degree sequence, yet violate the given out-degree sequence. It combines directed edge-swapping and constrained Monte-Carlo edge-mixing for improving approximations to the given out-degree sequence until it is exactly matched. Our method permits inclusion or exclusion of 'multi-edges', allowing assembly of weighted or binary networks. It further allows prescribing the overall percentage of such multiple connections-permitting exploration of a weighted synthetic network space unlike any other method currently available for comparison of real-world networks with controlled multi-edge proportion null spaces. The graph space is sampled by the method non-uniformly, yet the algorithm provides weightings for the sample space across all possible realisations allowing computation of statistical averages of network metrics as if they were sampled uniformly. Given a sequence of in- and out- degrees, the method can also produce simple graphs for sequences that satisfy conditions of graphicality. Our method successfully builds networks with order O(107) edges on the scale of minutes with a laptop running Matlab. We provide our implementation of the method on the GitHub repository for immediate use by the research community, and demonstrate its application to three real-world networks for null-space comparisons as well as the study of dynamics of neuronal networks.

Emergent Spaces for Coupled Oscillators.

Systems of coupled dynamical units (e.g., oscillators or neurons) are known to exhibit complex, emergent behaviors that may be simplified through coarse-graining: a process in which one discovers coarse variables and derives equations for their evolution. Such coarse-graining procedures often require extensive experience and/or a deep understanding of the system dynamics. In this paper we present a systematic, data-driven approach to discovering "bespoke" coarse variables based on manifold learning algorithms. We illustrate this methodology with the classic Kuramoto phase oscillator model, and demonstrate how our manifold learning technique can successfully identify a coarse variable that is one-to-one with the established Kuramoto order parameter. We then introduce an extension of our coarse-graining methodology which enables us to learn evolution equations for the discovered coarse variables via an artificial neural network architecture templated on numerical time integrators (initial value solvers). This approach allows us to learn accurate approximations of time derivatives of state variables from sparse flow data, and hence discover useful approximate differential equation descriptions of their dynamic behavior. We demonstrate this capability by learning ODEs that agree with the known analytical expression for the Kuramoto order parameter dynamics at the continuum limit. We then show how this approach can also be used to learn the dynamics of coarse variables discovered through our manifold learning methodology. In both of these examples, we compare the results of our neural network based method to typical finite differences complemented with geometric harmonics. Finally, we present a series of computational examples illustrating how a variation of our manifold learning methodology can be used to discover sets of "effective" parameters, reduced parameter combinations, for multi-parameter models with complex coupling. We conclude with a discussion of possible extensions of this approach, including the possibility of obtaining data-driven effective partial differential equations for coarse-grained neuronal network behavior, as illustrated by the synchronization dynamics of Hodgkin-Huxley type neurons with a Chung-Lu network. Thus, we build an integrated suite of tools for obtaining data-driven coarse variables, data-driven effective parameters, and data-driven coarse-grained equations from detailed observations of networks of oscillators.

Moving bumps in theta neuron networks.

We consider large networks of theta neurons on a ring, synaptically coupled with an asymmetric kernel. Such networks support stable "bumps" of activity, which move along the ring if the coupling kernel is asymmetric. We investigate the effects of the kernel asymmetry on the existence, stability, and speed of these moving bumps using continuum equations formally describing infinite networks. Depending on the level of heterogeneity within the network, we find complex sequences of bifurcations as the amount of asymmetry is varied, in strong contrast to the behavior of a classical neural field model.

Understanding the dynamics of biological and neural oscillator networks through exact mean-field reductions: a review.

Many biological and neural systems can be seen as networks of interacting periodic processes. Importantly, their functionality, i.e., whether these networks can perform their function or not, depends on the emerging collective dynamics of the network. Synchrony of oscillations is one of the most prominent examples of such collective behavior and has been associated both with function and dysfunction. Understanding how network structure and interactions, as well as the microscopic properties of individual units, shape the emerging collective dynamics is critical to find factors that lead to malfunction. However, many biological systems such as the brain consist of a large number of dynamical units. Hence, their analysis has either relied on simplified heuristic models on a coarse scale, or the analysis comes at a huge computational cost. Here we review recently introduced approaches, known as the Ott-Antonsen and Watanabe-Strogatz reductions, allowing one to simplify the analysis by bridging small and large scales. Thus, reduced model equations are obtained that exactly describe the collective dynamics for each subpopulation in the oscillator network via few collective variables only. The resulting equations are next-generation models: Rather than being heuristic, they exactly link microscopic and macroscopic descriptions and therefore accurately capture microscopic properties of the underlying system. At the same time, they are sufficiently simple to analyze without great computational effort. In the last decade, these reduction methods have become instrumental in understanding how network structure and interactions shape the collective dynamics and the emergence of synchrony. We review this progress based on concrete examples and outline possible limitations. Finally, we discuss how linking the reduced models with experimental data can guide the way towards the development of new treatment approaches, for example, for neurological disease.

The effects of within-neuron degree correlations in networks of spiking neurons.

We consider the effects of correlations between the in- and out-degrees of individual neurons on the dynamics of a network of neurons. By using theta neurons, we can derive a set of coupled differential equations for the expected dynamics of neurons with the same in-degree. A Gaussian copula is used to introduce correlations between a neuron's in- and out-degree, and numerical bifurcation analysis is used determine the effects of these correlations on the network's dynamics. For excitatory coupling, we find that inducing positive correlations has a similar effect to increasing the coupling strength between neurons, while for inhibitory coupling it has the opposite effect. We also determine the propensity of various two- and three-neuron motifs to occur as correlations are varied and give a plausible explanation for the observed changes in dynamics.

Dynamics and stability of chimera states in two coupled populations of oscillators.

We consider networks formed from two populations of identical oscillators, with uniform strength all-to-all coupling within populations and also between populations with a different strength. Such systems are known to support chimera states in which oscillators within one population are perfectly synchronized while in the other the oscillators are incoherent and have a different mean frequency from those in the synchronous population. Assuming that the oscillators in the incoherent population always lie on a closed smooth curve C, we derive and analyze the dynamics of the shape of C and the probability density on C for four different types of oscillators. We put some previously derived results on a more rigorous footing and analyze two new systems.

Generalised probability mass function for the final epidemic size of an SIR model on a line of triangles network.

We explore the feasibility of deriving generalised expressions for the probability mass function (PMF) of the final epidemic size of a Susceptible - Infected - Recovered (SIR) model on a finite network of an arbitrary number of nodes. Expressions for the probability that the infection progresses along a given pathway in a line of triangles (LoT) network are presented. Deriving expressions for the probability that the infection ends at any given node allows us to determine the corresponding final size of the epidemic, and hence produce PMFs of the final epidemic size. We illustrate how we can use the results from small networks derived in a previous study to describe how an infection spreads through a LoT network. The key here is to correctly decompose the larger network into an appropriate assemblage of small networks.

Chaos in small networks of theta neurons.

We consider small networks of instantaneously coupled theta neurons. For inhibitory coupling and fixed parameter values, some initial conditions give chaotic solutions while others give quasiperiodic ones. This behaviour seems to result from the reversibility of the equations governing the networks' dynamics. We investigate the robustness of the chaotic behaviour with respect to changes in initial conditions and parameters and find the behaviour to be quite robust as long as the reversibility of the system is preserved.

The Dynamics of Networks of Identical Theta Neurons.

We consider finite and infinite all-to-all coupled networks of identical theta neurons. Two types of synaptic interactions are investigated: instantaneous and delayed (via first-order synaptic processing). Extensive use is made of the Watanabe/Strogatz (WS) ansatz for reducing the dimension of networks of identical sinusoidally-coupled oscillators. As well as the degeneracy associated with the constants of motion of the WS ansatz, we also find continuous families of solutions for instantaneously coupled neurons, resulting from the reversibility of the reduced model and the form of the synaptic input. We also investigate a number of similar related models. We conclude that the dynamics of networks of all-to-all coupled identical neurons can be surprisingly complicated.