arXiv subjects

Marc Timme

Publications and source records attributed to Marc Timme.

117 records · Page 7Linked to original sources

arXiv2005

Speed of synchronization in complex networks of neural oscillators Analytic results based on Random Matrix Theory

We analyze the dynamics of networks of spiking neural oscillators. First, we present an exact linear stability theory of the synchronous state for networks of arbitrary connectivity. For general neuron rise functions, stability is determined by multiple operators, for which standard analysis is not suitable. We describe a general non-standard solution to the multi-operator problem. Subsequently, we derive a class of rise functions for which all stability operators become degenerate and standard eigenvalue analysis becomes a suitable tool. Interestingly, this class is found to consist of networks of leaky integrate and fire neurons. For random networks of inhibitory integrate-and-fire neurons, we then develop an analytical approach, based on the theory of random matrices, to precisely determine the eigenvalue distribution. This yields the asymptotic relaxation time for perturbations to the synchronous state which provides the characteristic time scale on which neurons can coordinate their activity in such networks. For networks with finite in-degree, i.e. finite number of presynaptic inputs per neuron, we find a speed limit to coordinating spiking activity: Even with arbitrarily strong interaction strengths neurons cannot synchronize faster than at a certain maximal speed determined by the typical in-degree.

q-bio.NC↗

arXiv2005

Unstable Attractors: Existence and Robustness in Networks of Oscillators With Delayed Pulse Coupling

We consider unstable attractors; Milnor attractors $A$ such that, for some neighbourhood $U$ of $A$, almost all initial conditions leave $U$. Previous research strongly suggests that unstable attractors exist and even occur robustly (i.e. for open sets of parameter values) in a system modelling biological phenomena, namely in globally coupled oscillators with delayed pulse interactions. In the first part of this paper we give a rigorous definition of unstable attractors for general dynamical systems. We classify unstable attractors into two types, depending on whether or not there is a neighbourhood of the attractor that intersects the basin in a set of positive measure. We give examples of both types of unstable attractor; these examples have non-invertible dynamics that collapse certain open sets onto stable manifolds of saddle orbits. In the second part we give the first rigorous demonstration of existence and robust occurrence of unstable attractors in a network of oscillators with delayed pulse coupling. Although such systems are technically hybrid systems of delay differential equations with discontinuous `firing' events, we show that their dynamics reduces to a finite dimensional hybrid system system after a finite time and hence we can discuss Milnor attractors for this reduced finite dimensional system. We prove that for an open set of phase resetting functions there are saddle periodic orbits that are unstable attractors.

cond-mat.dis-nn↗

arXiv2004

Long Chaotic Transients in Complex Networks

We show that long chaotic transients dominate the dynamics of randomly diluted networks of pulse-coupled oscillators. This contrasts with the rapid convergence towards limit cycle attractors found in networks of globally coupled units. The lengths of the transients strongly depend on the network connectivity and varies by several orders of magnitude, with maximum transient lengths at intermediate connectivities. The dynamics of the transient exhibits a novel form of robust synchronization. An approximation to the largest Lyapunov exponent characterizing the chaotic nature of the transient dynamics is calculated analytically.

cond-mat.dis-nn↗

arXiv2003

Breaking Synchrony by Heterogeneity in Complex Networks

For networks of pulse-coupled oscillators with complex connectivity, we demonstrate that in the presence of coupling heterogeneity precisely timed periodic firing patterns replace the state of global synchrony that exists in homogenous networks only. With increasing disorder, these patterns persist until they reach a critical temporal extent that is of the order of the interaction delay. For stronger disorder these patterns cease to exist and only asynchronous, aperiodic states are observed. We derive self-consistency equations to predict the precise temporal structure of a pattern from the network heterogeneity. Moreover, we show how to design heterogenous coupling architectures to create an arbitrary prescribed pattern.

cond-mat.dis-nn↗

arXiv2003

Topological Speed Limits to Network Synchronization

We study collective synchronization of pulse-coupled oscillators interacting on asymmetric random networks. We demonstrate that random matrix theory can be used to accurately predict the speed of synchronization in such networks in dependence on the dynamical and network parameters. Furthermore, we show that the speed of synchronization is limited by the network connectivity and stays finite, even if the coupling strength becomes infinite. In addition, our results indicate that synchrony is robust under structural perturbations of the network dynamics.

cond-mat.dis-nn↗

arXiv2003

Coexistence of regular and irregular dynamics in complex networks of pulse-coupled oscillators

For general networks of pulse-coupled oscillators, including regular, random, and more complex networks, we develop an exact stability analysis of synchronous states. As opposed to conventional stability analysis, here stability is determined by a multitude of linear operators. We treat this multi-operator problem analytically and show that for inhibitory interactions the synchronous state is stable, independent of the parameters and the network connectivity. In randomly connected networks with strong interactions this synchronous state, displaying \textit{regular} dynamics, coexists with a balanced state that exhibits \textit{irregular} dynamics such that external signals may switch the network between qualitatively distinct states.

cond-mat.dis-nn↗

arXiv2002

Prevalence of unstable attractors in networks of pulse-coupled oscillators

We present and analyze the first example of a dynamical system that naturally exhibits attracting periodic orbits that are \textit{unstable}. These unstable attractors occur in networks of pulse-coupled oscillators where they prevail for large networks and a wide range of parameters. They are enclosed by basins of attraction of other attractors but are remote from their own basin volume such that arbitrarily small noise leads to a switching among attractors.

cond-mat.dis-nn↗

arXiv2002

Unstable attractors induce perpetual synchronization and desynchronization

Common experience suggests that attracting invariant sets in nonlinear dynamical systems are generally stable. Contrary to this intuition, we present a dynamical system, a network of pulse-coupled oscillators, in which \textit{unstable attractors} arise naturally. From random initial conditions, groups of synchronized oscillators (clusters) are formed that send pulses alternately, resulting in a periodic dynamics of the network. Under the influence of arbitrarily weak noise, this synchronization is followed by a desynchronization of clusters, a phenomenon induced by attractors that are unstable. Perpetual synchronization and desynchronization lead to a switching among attractors. This is explained by the geometrical fact, that these unstable attractors are surrounded by basins of attraction of other attractors, whereas the full measure of their own basin is located remote from the attractor. Unstable attractors do not only exist in these systems, but moreover dominate the dynamics for large networks and a wide range of parameters.

cond-mat.dis-nn↗

arXiv2002

Universal Attractors of Reversible Aggregate-Reorganization Processes

We analyze a general class of reversible aggregate-reorganization processes. These processes are shown to exhibit globally attracting equilibrium distributions, which are \textit{universal}, i.e. identical for large classes of models. Furthermore, the analysis implies that for studies of equilibrium properties of \textit{any} such process, computationally expensive reorganization dynamics such as random walks can be replaced by more efficient, yet simpler methods. As a particular application, our results explain the recent observation of the formation of similar fractal aggregates from different initial structures by diffusive reorganization [Filoche and Sapoval, Phys. Rev. Lett. 85, 5118 (2000)].

cond-mat.stat-mech↗