arXiv subjects

Marc Timme

Publications and source records attributed to Marc Timme.

At least 109 records · Page 6Linked to original sources

arXiv2012

Network representations of non-equilibrium steady states: Cycle decompositions, symmetries and dominant paths

Non-equilibrium steady states (NESS) of Markov processes give rise to non-trivial cyclic probability fluxes. Cycle decompositions of the steady state offer an effective description of such fluxes. Here, we present an iterative cycle decomposition exhibiting a natural dynamics on the space of cycles that satisfies detailed balance. Expectation values of observables can be expressed as cycle "averages", resembling the cycle representation of expectation values in dynamical systems. We illustrate our approach in terms of an analogy to a simple model of mass transit dynamics. Symmetries are reflected in our approach by a reduction of the minimal number of cycles needed in the decomposition. These features are demonstrated by discussing a variant of an asymmetric exclusion process (TASEP). Intriguingly, a continuous change of dominant flow paths in the network results in a change of the structure of cycles as well as in discontinuous jumps in cycle weights.

math-ph↗

arXiv2012

Adapting Predictive Feedback Chaos Control for Optimal Convergence Speed

Stabilizing unstable periodic orbits in a chaotic invariant set not only reveals information about its structure but also leads to various interesting applications. For the successful application of a chaos control scheme, convergence speed is of crucial importance. Here we present a predictive feedback chaos control method that adapts a control parameter online to yield optimal asymptotic convergence speed. We study the adaptive control map both analytically and numerically and prove that it converges at least linearly to a value determined by the spectral radius of the control map at the periodic orbit to be stabilized. The method is easy to implement algorithmically and may find applications for adaptive online control of biological and engineering systems.

nlin.AO↗

arXiv2011

Small-world spectra in mean field theory

Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering and social science.

physics.soc-ph↗

arXiv2011

Chaos in Symmetric Phase Oscillator Networks

Phase-coupled oscillators serve as paradigmatic models of networks of weakly interacting oscillatory units in physics and biology. The order parameter which quantifies synchronization was so far found to be chaotic only in systems with inhomogeneities. Here we show that even symmetric systems of identical oscillators may not only exhibit chaotic dynamics, but also chaotically fluctuating order parameters. Our findings imply that neither inhomogeneities nor amplitude variations are necessary to obtain chaos, i.e., nonlinear interactions of phases give rise to the necessary instabilities.

nlin.CD↗

arXiv2011

Speed of complex network synchronization

Synchrony is one of the most common dynamical states emerging on networks. The speed of convergence towards synchrony provides a fundamental collective time scale for synchronizing systems. Here we study the asymptotic synchronization times for directed networks with topologies ranging from completely ordered, grid-like, to completely disordered, random, including intermediate, partially disordered topologies. We extend the approach of Master Stability Functions to quantify synchronization times. We find that the synchronization times strongly and systematically depend on the network topology. In particular, at fixed in-degree, stronger topological randomness induces faster synchronization, whereas at fixed path length, synchronization is slowest for intermediate randomness in the small-world regime. Randomly rewiring real-world neural, social and transport networks confirms this picture.

cond-mat.dis-nn↗

arXiv2011

Impact of Single Links in Competitive Percolation -- How complex networks grow under competition

How a complex network is connected crucially impacts its dynamics and function. Percolation, the transition to extensive connectedness upon gradual addition of links, was long believed to be continuous but recent numerical evidence on "explosive percolation" suggests that it might as well be discontinuous if links compete for addition. Here we analyze the microscopic mechanisms underlying discontinuous percolation processes and reveal a strong impact of single link additions. We show that in generic competitive percolation processes, including those displaying explosive percolation, single links do not induce a discontinuous gap in the largest cluster size in the thermodynamic limit. Nevertheless, our results highlight that for large finite systems single links may still induce observable gaps because gap sizes scale weakly algebraically with system size. Several essentially macroscopic clusters coexist immediately before the transition, thus announcing discontinuous percolation. These results explain how single links may drastically change macroscopic connectivity in networks where links add competitively.

cond-mat.dis-nn↗

arXiv2010

Inferring Network Topology from Complex Dynamics

Inferring network topology from dynamical observations is a fundamental problem pervading research on complex systems. Here, we present a simple, direct method to infer the structural connection topology of a network, given an observation of one collective dynamical trajectory. The general theoretical framework is applicable to arbitrary network dynamical systems described by ordinary differential equations. No interference (external driving) is required and the type of dynamics is not restricted in any way. In particular, the observed dynamics may be arbitrarily complex; stationary, invariant or transient; synchronous or asynchronous and chaotic or periodic. Presupposing a knowledge of the functional form of the dynamical units and of the coupling functions between them, we present an analytical solution to the inverse problem of finding the network topology. Robust reconstruction is achieved in any sufficiently long generic observation of the system. We extend our method to simultaneously reconstruct both the entire network topology and all parameters appearing linear in the system's equations of motion. Reconstruction of network topology and system parameters is viable even in the presence of substantial external noise.

nlin.CD↗

arXiv2010

Do Small Worlds Synchronize Fastest?

Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network synchronization. Here we study the asymptotic speed of synchronization of coupled oscillators in dependence on the degree of randomness of their interaction topology in generalized Watts-Strogatz ensembles. We find that networks with fixed in-degree synchronize faster the more random they are, with small worlds just appearing as an intermediate case. For any generic network ensemble, if synchronization speed is at all extremal at intermediate randomness, it is slowest in the small world regime. This phenomenon occurs for various types of oscillators, intrinsic dynamics and coupling schemes.

cond-mat.dis-nn↗

arXiv2009

Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in mathematical graph theory, and in computer science. Counting problems, however, are among the hardest problems to access computationally. Here, we suggest a novel method to access a benchmark counting problem, finding chromatic polynomials of graphs. We develop a vertex-oriented symbolic pattern matching algorithm that exploits the equivalence between the chromatic polynomial and the zero-temperature partition function of the Potts antiferromagnet on the same graph. Implementing this bottom-up algorithm using appropriate computer algebra, the new method outperforms standard top-down methods by several orders of magnitude, already for moderately sized graphs. As a first application, we compute chromatic polynomials of samples of the simple cubic lattice, for the first time computationally accessing three-dimensional lattices of physical relevance. The method offers straightforward generalizations to several other counting problems.

cond-mat.stat-mech↗

arXiv2008

Partial Reset in Pulse-Coupled Oscillators

Pulse-coupled threshold units serve as paradigmatic models for a wide range of complex systems. When the state variable of a unit crosses a threshold, the unit sends a pulse that is received by other units, thereby mediating the interactions. At the same time, the state variable of the sending unit is reset. Here we study pulse-coupled models with a reset that may be partial only and is mediated by a partial reset function. Such a partial reset characterizes intrinsic physical or biophysical features of a unit (e.g., resistive coupling between dendrite and soma of compartmental neurons) and at the same time makes possible a rigorous mathematical investigation of the collective network dynamics. The partial reset acts as a desynchronization mechanism. For all-to-all pulse-coupled oscillators an increase in the strength of the partial reset causes a sequence of desynchronizing bifurcations from the fully synchronous state via states with large clusters of synchronized units through states with smaller clusters to complete asynchrony. We analytically derive sufficient and necessary conditions for the existence and stability of periodic cluster states on the local dynamics of the oscillators and on the partial reset function to reveal the mechanism underlying the desynchronization transition. We show that the entire sequence may occur due to arbitrarily small changes of the partial reset and is robust against structural perturbations.

math.DS↗

arXiv2008

Bifurcation From Networks of Unstable Attractors to Heteroclinic Switching

We present a dynamical system that naturally exhibits two unstable attractors that are completely enclosed by each others basin volume. This counter-intuitive phenomenon occurs in networks of pulse-coupled oscillators with delayed interactions. We analytically and numerically investigate this phenomenon and clarify the mechanism underlying it: Upon continuously removing the non-invertibility of the system, the set of two unstable attractors becomes a set of two non-attracting saddle states that are heteroclinically connected to each other. This transition from a network of unstable attractors to a heteroclinic cycle constitutes a new type of bifurcation in dynamical systems.

nlin.CD↗

arXiv2008

The simplest problem in the collective dynamics of neural networks: Is synchrony stable?

For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem -- local stability of synchrony -- is non-trivial to solve and requires novel methods for its solution. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron-Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all.

math.DS↗

arXiv2008

Sequential Desynchronization in Networks of Spiking Neurons with Partial Reset

The response of a neuron to synaptic input strongly depends on whether or not it has just emitted a spike. We propose a neuron model that after spike emission exhibits a partial response to residual input charges and study its collective network dynamics analytically. We uncover a novel desynchronization mechanism that causes a sequential desynchronization transition: In globally coupled neurons an increase in the strength of the partial response induces a sequence of bifurcations from states with large clusters of synchronously firing neurons, through states with smaller clusters to completely asynchronous spiking. We briefly discuss key consequences of this mechanism for more general networks of biophysical neurons.

q-bio.NC↗

arXiv2007

Stable Irregular Dynamics in Complex Neural Networks

For infinitely large sparse networks of spiking neurons mean field theory shows that a balanced state of highly irregular activity arises under various conditions. Here we analytically investigate the microscopic irregular dynamics in finite networks of arbitrary connectivity, keeping track of all individual spike times. For delayed, purely inhibitory interactions we demonstrate that the irregular dynamics is not chaotic but rather stable and convergent towards periodic orbits. Moreover, every generic periodic orbit of these dynamical systems is stable. These results highlight that chaotic and stable dynamics are equally capable of generating irregular activity.

cond-mat.dis-nn↗

arXiv2006

Designing Complex Networks

We suggest a new perspective of research towards understanding the relations between structure and dynamics of a complex network: Can we design a network, e.g. by modifying the features of units or interactions, such that it exhibits a desired dynamics? Here we present a case study where we positively answer this question analytically for networks of spiking neural oscillators. First, we present a method of finding the set of all networks (defined by all mutual coupling strengths) that exhibit an arbitrary given periodic pattern of spikes as an invariant solution. In such a pattern all the spike times of all the neurons are exactly predefined. The method is very general as it covers networks of different types of neurons, excitatory and inhibitory couplings, interaction delays that may be heterogeneously distributed, and arbitrary network connectivities. Second, we show how to design networks if further restrictions are imposed, for instance by predefining the detailed network connectivity. We illustrate the applicability of the method by examples of Erdös-Rényi and power-law random networks. Third, the method can be used to design networks that optimize network properties. To illustrate this idea, we design networks that exhibit a predefined pattern dynamics while at the same time minimizing the networks' wiring costs.

q-bio.NC↗

arXiv2006

Designing the Dynamics of Spiking Neural Networks

Precise timing of spikes and temporal locking are key elements of neural computation. Here we demonstrate how even strongly heterogeneous, deterministic neural networks with delayed interactions and complex topology can exhibit periodic patterns of spikes that are precisely timed. We develop an analytical method to find the set of all networks exhibiting a predefined pattern dynamics. Such patterns may be arbitrarily long and of complicated temporal structure. We point out that the same pattern can exist in very different networks and have different stability properties.

q-bio.NC↗

arXiv2006

Revealing Network Connectivity From Dynamics

We present a method to infer network connectivity from collective dynamics in networks of synchronizing phase oscillators. We study the long-term stationary response to temporally constant driving. For a given driving condition, measuring the phase differences and the collective frequency reveals information about how the oscillators are interconnected. Sufficiently many repetitions for different driving conditions yield the entire network connectivity from measuring the dynamics only. For sparsely connected networks we obtain good predictions of the actual connectivity even for formally under-determined problems.

cond-mat.dis-nn↗

arXiv2006

Does dynamics reflect topology in directed networks?

We present and analyze a topologically induced transition from ordered, synchronized to disordered dynamics in directed networks of oscillators. The analysis reveals where in the space of networks this transition occurs and its underlying mechanisms. If disordered, the dynamics of the units is precisely determined by the topology of the network and thus characteristic for it. We develop a method to predict the disordered dynamics from topology. The results suggest a new route towards understanding how the precise dynamics of the units of a directed network may encode information about its topology.

cond-mat.dis-nn↗