The role of degree-weighted couplings in the synchronous onset of Kuramoto oscillator networks

This paper investigates the role of asymmetrical degree-dependent weighted couplings in synchronization of a network of Kuramoto oscillators, where the conditions of coupling criticality for the onset of phase synchronization in degree-weighted complex networks are arrived at. The numerical simulations visualize that for networks having power-law or exponential degree distributions, asymmetrical degree-weighted couplings (with increasing weighting exponent β) increases the critical coupling to achieve the onset of phase synchronization in the networks.     

Nonlocal Mechanism for Synchronization of Time Delay Networks

We present the interplay between synchronization of networks with heterogeneous delays and the greatest common divisor (GCD) of loops composing the network. We distinguish between two types of networks; (I) chaotic networks and (II) population dynamic networks with periodic activity driven by external stimuli. For type (I), in the weak chaos region, the units of a chaotic network characterized by GCD=1 are in a chaotic zero-lag synchronization, whereas for GCD>1, the network splits into GCD-clusters in which clustered units are in zero-lag synchronization. These results are supported by simulations of chaotic systems, self-consistent and mixing arguments, as well as analytical solutions of Bernoulli maps. Type (II) is exemplified by simulations of Hodgkin Huxley population dynamic networks with unidirectional connectivity, synaptic noise and distribution of delays within neurons belonging to a node and between connecting nodes. For a stimulus to one node, the network splits into GCD-clusters in which cluster neurons are in zero-lag synchronization. For complex external stimuli, the network splits into clusters equal to the greatest common divisor of loops composing the network (spatial) and the periodicity of the external stimuli (temporal). The results suggest that neural information processing may take place in the transient to synchronization and imply a much shorter time scale for the inference of a perceptual entity.     

Generalized synchronization in complex dynamical networks via adaptive couplings

This paper investigates generalized synchronization of three typical classes of complex dynamical networks: scale-free networks, small-world networks, and interpolating networks. The proposed synchronization strategy is to adjust adaptively a node’s coupling strength based on the node’s local generalized synchronization information. By taking the auxiliary-system approach and using the Lyapunov function method, we prove that for any given initial coupling strengths, the generalized synchronization can take place in complex networks consisting of nonidentical dynamical systems. It is demonstrated that the coupling strengths are affected by topologies of the networks. Furthermore, it is found that there are hierarchical features in the processes of generalized synchronization in scale-free networks because of their highly heterogeneous distributions of connection degree. Finally, we discuss in detail how a network’s degree of heterogeneity affects its generalization synchronization behavior.     

Global synchronization for a class of dynamical complex networks

This paper is concerned with the problem of global synchronization for a class of dynamical complex networks composed of general Lur’e systems. Based on the absolute stability theory and the Kalman-Yakubovich-Popov (KYP) lemma, sufficient conditions are established to guarantee global synchronization of dynamical networks with complex topology, directed and weighted couplings. Several global synchronization criteria formulated in the form of linear matrix inequalities (LMIs) or frequency-domain inequalities are also proposed for undirected dynamical networks. In order to obtain global results, no linearization technique is involved through derivation of the synchronization criteria. Numerical examples are provided to demonstrate the effectiveness of the proposed results.     

Concentric circular arrays of Josephson junctions as dressed models of granular superconductors

In this paper networks that optimize a combined measure of local and global synchronizability are evolved. It is shown that for low coupling improvements in the local synchronizability dominate network evolution. This leads to an expressed grouping of elements with similar native frequency into cliques, allowing for an early onset of synchronization, but rendering full synchronization hard to achieve. In contrast, for large coupling the network evolution is governed by improvements towards full synchronization, preventing any expressed community structure. Such networks exhibit strong coupling between dissimilar oscillators. Albeit a rapid transition to full synchronization is achieved, the onset of synchronization is delayed in comparison to the first type of networks. The paper illustrates that an early onset of synchronization (which relates to clustering) and global synchronization are conflicting demands on network topology.     

Synchronization of oscillators in complex networks

Theory of identical or complete synchronization of identical oscillators in arbitrary networks is introduced. In addition, several graph theory concepts and results that augment the synchronization theory and a tie in closely to random, semirandom, and regular networks are introduced. Combined theories are used to explore and compare three types of semirandom networks for their efficacy in synchronizing oscillators. It is shown that the simplest k-cycle augmented by a few random edges or links are the most efficient network that will guarantee good synchronization.      

Enhancing robustness and synchronizability of networks homogenizing their degree distribution

A new family of networks, called entangled, has recently been proposed in the literature. These networks have optimal properties in terms of synchronization, robustness against errors and attacks, and efficient communication. They are built with an algorithm which uses modified simulated annealing to enhance a well-known measure of networks’ ability to reach synchronization among nodes. In this work, we suggest that a class of networks similar to entangled networks can be produced by changing some of the connections in a given network, or by just adding a few connections. We call this class of networks weak-entangled. Although entangled networks can be considered as a subset of weak-entangled networks, we show that both classes share similar properties, especially with respect to synchronization and robustness, and that they have similar structural properties.     

Exponential synchronization of complex networks with Markovian jump and mixed delays

In this Letter, we investigate the exponential synchronization problem for an array of N linearly coupled complex networks with Markovian jump and mixed time-delays. The complex network consists of m modes and the network switches from one mode to another according to a Markovian chain with known transition probability. The mixed time-delays are composed of discrete and distributed delays, both of which are mode-dependent. The nonlinearities imbedded with the complex networks are assumed to satisfy the sector condition that is more general than the commonly used Lipschitz condition. By making use of the Kronecker product and the stochastic analysis tool, we propose a novel Lyapunov–Krasovskii functional suitable for handling distributed delays and then show that the addressed synchronization problem is solvable if a set of linear matrix inequalities (LMIs) are feasible. Therefore, a unified LMI approach is developed to establish sufficient conditions for the coupled complex network to be globally exponentially synchronized in the mean square. Note that the LMIs can be easily solved by using the Matlab LMI toolbox and no tuning of parameters is required. A simulation example is provided to demonstrate the usefulness of the main results obtained.     

Synchronization Dynamics in Non-Normal Networks: The Trade-Off for Optimality

Synchronization is an important behavior that characterizes many natural and human made systems that are composed by several interacting units. It can be found in a broad spectrum of applications, ranging from neuroscience to power-grids, to mention a few. Such systems synchronize because of the complex set of coupling they exhibit, with the latter being modeled by complex networks. The dynamical behavior of the system and the topology of the underlying network are strongly intertwined, raising the question of the optimal architecture that makes synchronization robust. The Master Stability Function (MSF) has been proposed and extensively studied as a generic framework for tackling synchronization problems. Using this method, it has been shown that, for a class of models, synchronization in strongly directed networks is robust to external perturbations. Recent findings indicate that many real-world networks are strongly directed, being potential candidates for optimal synchronization. Moreover, many empirical networks are also strongly non-normal. Inspired by this latter fact in this work, we address the role of the non-normality in the synchronization dynamics by pointing out that standard techniques, such as the MSF, may fail to predict the stability of synchronized states. We demonstrate that, due to a transient growth that is induced by the structure’s non-normality, the system might lose synchronization, contrary to the spectral prediction. These results lead to a trade-off between non-normality and directedness that should be properly considered when designing an optimal network, enhancing the robustness of synchronization.     

Mutual and intermittent enhancements of synchronization transitions by autaptic and synaptic delay in scale-free neuron networks

In neural networks, there exist both synaptic delays among different neurons and autaptic self-feedback delays in a neuron itself. In this paper, we study synchronization transitions induced by synaptic and autaptic delays in scale-free neuron networks, mainly exploring how these two time delays affect synchronization transitions induced by each other. It is found that the synchronization transitions induced by synaptic (autaptic) delay are intermittently enhanced when autaptic (synaptic) delay is varied. There are optimal autaptic strength and synaptic coupling strength by which the synchronization transitions induced by autaptic and synaptic delays become strongest. The underlying mechanisms are briefly discussed in terms of the relationships of autaptic delay, synaptic delay, and inter-burst interval. These results show that synaptic and autaptic delays could contribute to each other and enhance synchronization transitions in the neuronal networks. This implies that autaptic and synaptic delays could play a vital role for the information transmission in neural systems.     

Delay-induced synchronization transitions in small-world neuronal networks with hybrid electrical and chemical synapses

We study the dependence of synchronization transitions in small-world networks of bursting neurons with hybrid electrical–chemical synapses on the information transmission delay, the probability of electrical synapses, and the rewiring probability. It is shown that, irrespective of the probability of electrical synapses, the information transmission delay can always induce synchronization transitions in small-world neuronal networks, i.e., regions of synchronization and nonsynchronization appear intermittently as the delay increases. In particular, all these transitions to burst synchronization occur approximately at integer multiples of the bursting period of individual neurons. In addition, for larger probability of electrical synapses, the intermittent synchronization transition is more profound, due to the stronger synchronization ability of electrical synapses compared with chemical ones. More importantly, chemical and electrical synapses can perform complementary roles in the synchronization of hybrid small-world neuronal networks: the larger the electrical synapse strength is, the smaller the chemical synapse strength needed to achieve burst synchronization. Furthermore, the small-world topology has a significant effect on the synchronization transition in hybrid neuronal networks. It is found that increasing the rewiring probability can always enhance the synchronization of neuronal activity. The results obtained are instructive for understanding the synchronous behavior of neural systems.     

Multi-time-scale synchronization and information processing in bursting neuron networks

We analyze the effect of synchronization in networks of chemically coupled multi-time-scale (spiking-bursting) neurons on the process of information transmission within the network. Although, synchronization occurs first in the slow time-scale (burst) and then in the fast time-scale (spike), we show that information can be transmitted with low probability of errors in both time scales when the bursts become synchronized. Furthermore, we show that for networks of non-identical multi-time-scales neurons, complete synchronization is no longer possible, but instead burst phase synchronization. Our analysis shows that clusters of burst phase synchronized neurons are very likely to appear in a network for parameters far smaller than the ones for which the onset of burst phase synchronization in the whole network takes place.     

最优的Newman-Watts网络与遍历网络的同步

在Hindmarsh-Rose神经元动力系统中研究了Newman-Watts （NW）网络的同步,给出了一些最优同步网络的拓扑结构. 数值结果表明：NW网络的同步能力主要由耦合点在耦合空间的分布决定,耦合点分布均匀的NW网络一般具有较强的同步能力;在给定连边数的情况下,可能存在多个结构不同的最优同步网络,最优同步网络具有最强的同步能力、均匀的度分布和较好的对称性,但是其对称性不一定是最好的. 最优同步网络一般是非规则网络,但在少数情况下,规则网络也有可能是最优同步网络. 提出了一种新的网络——遍历网络,该网络具有最优同步网络的特点和很强的同步能力. 关键词： Newman-Watts网络 对称度 耦合空间 同步     

Cluster synchronization in networks of distinct groups of maps

In this paper, we study cluster synchronization in general bi-directed networks of nonidentical clusters, where all nodes in the same cluster share an identical map. Based on the transverse stability analysis, we present sufficient conditions for local cluster synchronization of networks. The conditions are composed of two factors: the common inter-cluster coupling, which ensures the existence of an invariant cluster synchronization manifold, and communication between each pair of nodes in the same cluster, which is necessary for chaos synchronization. Consequently, we propose a quantity to measure the cluster synchronizability for a network with respect to the given clusters via a function of the eigenvalues of the Laplacian corresponding to the generalized eigenspace transverse to the cluster synchronization manifold. Then, we discuss the clustering synchronous dynamics and cluster synchronizability for four artificial network models: (i) p-nearest-neighborhood graph; (ii) random clustering graph; (iii) bipartite random graph; (iv) degree-preferred growing clustering network. From these network models, we are to reveal how the intra-cluster and inter-cluster links affect the cluster synchronizability. By numerical examples, we find that for the first model, the cluster synchronizability regularly enhances with the increase of p, yet for the other three models, when the ratio of intra-cluster links and the inter-cluster links reaches certain quantity, the clustering synchronizability reaches maximal.     

Robust outer synchronization between two complex networks with fractional order dynamics

Synchronization between two coupled complex networks with fractional-order dynamics, hereafter referred to as outer synchronization, is investigated in this work. In particular, we consider two systems consisting of interconnected nodes. The state variables of each node evolve with time according to a set of (possibly nonlinear and chaotic) fractional-order differential equations. One of the networks plays the role of a master system and drives the second network by way of an open-plus-closed-loop (OPCL) scheme. Starting from a simple analysis of the synchronization error and a basic lemma on the eigenvalues of matrices resulting from Kronecker products, we establish various sets of conditions for outer synchronization, i.e., for ensuring that the errors between the state variables of the master and response systems can asymptotically vanish with time. Then, we address the problem of robust outer synchronization, i.e., how to guarantee that the states of the nodes converge to common values when the parameters of the master and response networks are not identical, but present some perturbations. Assuming that these perturbations are bounded, we also find conditions for outer synchronization, this time given in terms of sets of linear matrix inequalities (LMIs). Most of the analytical results in this paper are valid both for fractional-order and integer-order dynamics. The assumptions on the inner (coupling) structure of the networks are mild, involving, at most, symmetry and diffusivity. The analytical results are complemented with numerical examples. In particular, we show examples of generalized and robust outer synchronization for networks whose nodes are governed by fractional-order Lorenz dynamics.     

噪声环境下时滞耦合网络的广义投影滞后同步

时滞和噪声在复杂网络中普遍存在,而含有耦合时滞和噪声摄动的耦合网络同步的研究工作却极其稀少. 本文针对噪声环境下具有不同节点动力学、不同拓扑结构及不同节点数目的耦合时滞网络,提出了两个网络之间的广义投影滞后同步. 首先,构建了更加贴近现实的驱动-响应网络同步的理论框架;其次,基于随机时滞微分方程LaSalle不变性原理,严格证明了在合理的控制器作用下,驱动网络和响应网络在几乎必然渐近稳定性意义下能够取得广义投影滞后同步;最后,借助于计算机仿真,通过具体的网络模型验证了理论推理的有效性. 数值模拟结果表明,驱动网络与响应网络不但能够达到广义投影滞后同步,而且同步效果不依赖于耦合时滞和比例因子的选取,同时也揭示了更新增益和耦合时滞对同步收敛速度的显著性影响. 关键词： 复杂网络 广义投影滞后同步 随机噪声 时滞     

Channel block-optimized spiking activity of Hodgkin-Huxley neurons on random networks

In this paper, we numerically study the effect of channel block on the spiking temporal coherence and spatial synchronization on Hodgkin-Huxley (HH) neuron networks. It is found that under sodium CB the spike coherence is badly reduced, and the synchronization can, depending on the network randomness (the fraction of random shortcuts), be either enhanced or reduced, while, under potassium CB, the spike coherence can be enhanced but the synchronization is reduced. Interestingly, for certain networks of relatively large randomness, the neuron firings can achieve the best temporal coherence at an optimal potassium CB. These results show that under certain conditions channel blocking can increase and optimize the spike coherence and the synchronization on the complex HH neuron networks, whereby the neurons would exhibit a better and the best sub-threshold signal encoding.     

Enhancing synchronizability by rewiring networks

<正>According to different forms of synchronized region,complex networks are divided into typeⅠ(unbounded synchronization region) and typeⅡ(bounded synchronization region) networks.This paper presents a rewiring algorithm to enhance the synchronizability of typeⅠand typeⅡnetworks.By utilizing the algorithm for an unweighted and undirected network,a better synchronizability of network with the same number of nodes and edges can be obtained. Numerical simulations on several different network models are used to support the proposed procedure.The relationship between different topological properties of the networks and the number of rewirings are shown.It finds that the final optimized network is independent of the initial network,and becomes homogeneous.In addition the optimized networks have similar structural properties in the sense of degree,and node and edge betweenness centralities.However,they do not have similar cluster coefficients for typeⅡnetworks.The research may be useful for designing more synchronizable networks and understanding the synchronization behaviour of networks.     

Physical-layer distributed synchronization in wireless networks and applications

Physical-layer (pulse-coupled) techniques for distributed synchronization in wireless networks are attracting significant attention for their efficiency and scalability. In this paper, the model of pulse-coupled discrete Phase Locked Loops is reviewed and further investigated in two directions. At first, we extend the characterization of (frequency or phase) synchronous states and convergence conditions from homogeneous networks, where all the nodes have the same power constraints, to more general heterogeneous networks. Towards this goal, we build on recent results on algebraic graph theory for generally non-bidirectional graphs, and derive: (i) necessary and sufficient conditions for global synchronization of the network; (ii) closed-form expressions for the asymptotic values of frequency and phases, as a function of the network topology. In the second part of the paper, an application of pulse-coupled synchronization is considered, namely data collection in a sensor network. The energy efficiency of two medium access protocols for data collection from a set of randomly located sensors to an access point is compared: (i) basic ALOHA (which does not require time synchronization among the sensors); (ii) slotted ALOHA, where time synchronization is achieved via pulse-coupled clocks. Analysis shows that the energy spent for maintaining synchronization in slotted ALOHA pays off in terms of total energy consumption with respect to basic ALOHA provided that the number of sensors is sufficiently small. Moreover, the energy gain is proved to depend explicitly on the system load (in terms of packets /s), hardware and topology of the network.     

Synchronization speed of identical oscillators on community networks

Synchronizability of complex oscillators networks has attracted much research interest in recent years. In contrast, in this paper we investigate numerically the synchronization speed, rather than the synchronizability or synchronization stability, of identical oscillators on complex networks with communities. A new weighted community network model is employed here, in which the community strength could be tunable by one parameter δ. The results showed that the synchronization speed of identical oscillators on community networks could reach a maximal value when δ is around 0.1. We argue that this is induced by the competition between the community partition and the scale-free property of the networks. Moreover, we have given the corresponding analysis through the second least eigenvalue λ₂ of the Laplacian matrix of the network which supports the previous result that the synchronization speed is determined by the value of λ₂.