Master Stability Functions for Coupled Near-Identical Dynamical Systems

We derive a master stability function (MSF) for synchronization in networks of coupled dynamical systems with small but arbitrary parametric variations. Analogous to the MSF for identical systems, our generalized MSF simultaneously solves the linear stability problem for near-synchronous states (NSS) for all possible connectivity structures. We also derive a general sufficient condition for stable near-synchronization and show that the synchronization error scales linearly with the magnitude of parameter variations.Our analysis underlines significant roles played by the Laplacian eigenvectors in the study of network synchronization of near-identical systems.Comment: 11 pages, 2 figure

Mean-field nature of synchronization stability in networks with multiple interaction layers

The interactions between the components of many real-world systems are best modelled by networks with multiple layers. Different theories have been proposed to explain how multilayered connections affect the linear stability of synchronization in dynamical systems. However, the resulting equations are computationally expensive, and therefore difficult, if not impossible, to solve for large systems. To bridge this gap, we develop a mean-field theory of synchronization for networks with multiple interaction layers. By assuming quasi-identical layers, we obtain accurate assessments of synchronization stability that are comparable with the exact results. In fact, the accuracy of our theory remains high even for networks with very dissimilar layers, thus posing a general question about the mean-field nature of synchronization stability in multilayer networks. Moreover, the computational complexity of our approach is only quadratic in the number of nodes, thereby allowing the study of systems whose investigation was thus far precluded. Multilayer networks can achieve synchronization, both for homogeneous and heterogeneous layers, whose dynamics is described by a system of equations often computationally complex and expensive. Here, the authors propose a mean-field approach for estimating the stability of the synchronized state of multilayer networks and show this applies to both homogeneous and heterogeneous layers, lowering computational complexity

Analysis of parameter mismatches in the master stability function for network synchronization

In this letter, we perform a sensitivity analysis on the master stability function approach for the synchronization of networks of coupled dynamical systems. More specifically, we analyze the linear stability of a nearly synchronized solution for a network of coupled dynamical systems, for which the individual dynamics and output functions of each unit are approximately identical and the sums of the entries in the rows of the coupling matrix slightly deviate from zero. The motivation for this parametric study comes from experimental instances of synchronization in human-made or natural settings, where ideal conditions are difficult to observe.Comment: Accepted for publication in EuroPhysics Letter

Synchronous behavior in networks of coupled systems : with applications to neuronal dynamics

Synchronization in networks of interacting dynamical systems is an interesting phenomenon that arises in nature, science and engineering. Examples include the simultaneous flashing of thousands of fireflies, the synchronous firing of action potentials by groups of neurons, cooperative behavior of robots and synchronization of chaotic systems with applications to secure communication. How is it possible that systems in a network synchronize? A key ingredient is that the systems in the network "communicate" information about their state to the systems they are connected to. This exchange of information ultimately results in synchronization of the systems in the network. The question is how the systems in the network should be connected and respond to the received information to achieve synchronization. In other words, which network structures and what kind of coupling functions lead to synchronization of the systems? In addition, since the exchange of information is likely to take some time, can systems in networks show synchronous behavior in presence of time-delays? The first part of this thesis focusses on synchronization of identical systems that interact via diffusive coupling, that is a coupling defined through the weighted difference of the output signals of the systems. The coupling might contain timedelays. In particular, two types of diffusive time-delay coupling are considered: coupling type I is diffusive coupling in which only the transmitted signals contain a time-delay, and coupling type II is diffusive coupling in which every signal is timedelayed. It is proven that networks of diffusive time-delay coupled systems that satisfy a strict semipassivity property have solutions that are ultimately bounded. This means that the solutions of the interconnected systems always enter some compact set in finite time and remain in that set ever after. Moreover, it is proven that nonlinear minimum-phase strictly semipassive systems that interact via diffusive coupling always synchronize provided the interaction is sufficiently strong. If the coupling functions contain time-delays, then these systems synchronize if, in addition to the sufficiently strong interaction, the product of the time-delay and the coupling strength is sufficiently small. Next, the specific role of the topology of the network in relation to synchronization is discussed. First, using symmetries in the network, linear invariant manifolds for networks of the diffusively time-delayed coupled systems are identified. If such a linear invariant manifold is also attracting, then the network possibly shows partial synchronization. Partial synchronization is the phenomenon that some, at least two, systems in the network synchronize with each other but not with every system in the network. It is proven that a linear invariant manifold defined by a symmetry in a network of strictly semipassive systems is attracting if the coupling strength is sufficiently large and the product of the coupling strength and the time-delay is sufficiently small. The network shows partial synchronization if the values of the coupling strength and time-delay for which this manifold is attracting differ from those for which all systems in the network synchronize. Next, for systems that interact via symmetric coupling type II, it is shown that the values of the coupling strength and time-delay for which any network synchronizes can be determined from the structure of that network and the values of the coupling strength and time-delay for which two systems synchronize. In the second part of the thesis the theory presented in the first part is used to explain synchronization in networks of neurons that interact via electrical synapses. In particular, it is proven that four important models for neuronal activity, namely the Hodgkin-Huxley model, the Morris-Lecar model, the Hindmarsh-Rose model and the FitzHugh-Nagumo model, all have the semipassivity property. Since electrical synapses can be modeled by diffusive coupling, and all these neuronal models are nonlinear minimum-phase, synchronization in networks of these neurons happens if the interaction is sufficiently strong and the product of the time-delay and the coupling strength is sufficiently small. Numerical simulations with various networks of Hindmarsh-Rose neurons support this result. In addition to the results of numerical simulations, synchronization and partial synchronization is witnessed in an experimental setup with type II coupled electronic realizations of Hindmarsh-Rose neurons. These experimental results can be fully explained by the theoretical findings that are presented in the first part of the thesis. The thesis continues with a study of a network of pancreatic -cells. There is evidence that these beta-cells are diffusively coupled and that the synchronous bursting activity of the network is related to the secretion of insulin. However, if the network consists of active (oscillatory) beta-cells and inactive (dead) beta-cells, it might happen that, due to the interaction between the active and inactive cells, the activity of the network dies out which results in a inhibition of the insulin secretion. This problem is related to Diabetes Mellitus type 1. Whether the activity dies out or not depends on the number of cells that are active relative to the number of inactive cells. A bifurcation analysis gives estimates of the number of active cells relative to the number of inactive cells for which the network remains active. At last the controlled synchronization problem for all-to-all coupled strictly semipassive systems is considered. In particular, a systematic design procedure is presented which gives (nonlinear) coupling functions that guarantee synchronization of the systems. The coupling functions have the form of a definite integral of a scalar weight function on a interval defined by the outputs of the systems. The advantage of these coupling functions over linear diffusive coupling is that they provide high gain only when necessary, i.e. at those parts of the state space of the network where nonlinearities need to be suppressed. Numerical simulations in networks of Hindmarsh-Rose neurons support the theoretical results

Synchronization of Nonlinear Circuits in Dynamic Electrical Networks with General Topologies

Sufficient conditions are derived for global asymptotic synchronization in a system of identical nonlinear electrical circuits coupled through linear time-invariant (LTI) electrical networks. In particular, the conditions we derive apply to settings where: i) the nonlinear circuits are composed of a parallel combination of passive LTI circuit elements and a nonlinear voltage-dependent current source with finite gain; and ii) a collection of these circuits are coupled through either uniform or homogeneous LTI electrical networks. Uniform electrical networks have identical per-unit-length impedances. Homogeneous electrical networks are characterized by having the same effective impedance between any two terminals with the others open circuited. Synchronization in these networks is guaranteed by ensuring the stability of an equivalent coordinate-transformed differential system that emphasizes signal differences. The applicability of the synchronization conditions to this broad class of networks follows from leveraging recent results on structural and spectral properties of Kron reduction---a model-reduction procedure that isolates the interactions of the nonlinear circuits in the network. The validity of the analytical results is demonstrated with simulations in networks of coupled Chua's circuits

Synchronization in an array of linearly stochastically coupled networks with time delays

This is the post print version of the article. The official published version can be obtained from the link - Copyright 2007 Elsevier LtdIn this paper, the complete synchronization problem is investigated in an array of linearly stochastically coupled identical networks with time delays. The stochastic coupling term, which can reflect a more realistic dynamical behavior of coupled systems in practice, is introduced to model a coupled system, and the influence from the stochastic noises on the array of coupled delayed neural networks is studied thoroughly. Based on a simple adaptive feedback control scheme and some stochastic analysis techniques, several sufficient conditions are developed to guarantee the synchronization in an array of linearly stochastically coupled neural networks with time delays. Finally, an illustrate example with numerical simulations is exploited to show the effectiveness of the theoretical results.This work was jointly supported by the National Natural Science Foundation of China under Grant 60574043, the Royal Society of the United Kingdom, the Natural Science Foundation of Jiangsu Province of China under Grant BK2006093, and International Joint Project funded by NSFC and the Royal Society of the United Kingdom

Stability and synchronization of discrete-time Markovian jumping neural networks with mixed mode-dependent time delays

Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we introduce a new class of discrete-time neural networks (DNNs) with Markovian jumping parameters as well as mode-dependent mixed time delays (both discrete and distributed time delays). Specifically, the parameters of the DNNs are subject to the switching from one to another at different times according to a Markov chain, and the mixed time delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. We first deal with the stability analysis problem of the addressed neural networks. A special inequality is developed to account for the mixed time delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the stochastic stability. We then turn to the synchronization problem among an array of identical coupled Markovian jumping neural networks with mixed mode-dependent time delays. By utilizing the Lyapunov stability theory and the Kronecker product, it is shown that the addressed synchronization problem is solvable if several LMIs are feasible. Hence, different from the commonly used matrix norm theories (such as the M-matrix method), a unified LMI approach is developed to solve the stability analysis and synchronization problems of the class of neural networks under investigation, where the LMIs can be easily solved by using the available Matlab LMI toolbox. Two numerical examples are presented to illustrate the usefulness and effectiveness of the main results obtained