Synchronization of coupled logistic maps on random community networks

The collective synchronization of a system of coupled logistic maps on random community networks is investigated. It is found that the synchronizability of the community network is affected by two factors when the size of the network and the number of connections are fixed. One is the number of communities denoted by the parameter rn, and the other is the ratio σ of the connection probability p of each pair of nodes within each community to the connection probability q of each pair of nodes among different communities. Theoretical analysis and numerical results indicate that larger rn and smaller σ are the key to the enhancement of network synchronizability. We also testify synchronous properties of the system by analysing the largest Lyapunov exponents of the system.     

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.     

基于相对距离的复杂网络谱粗粒化方法

复杂网络的同步作为一种重要的网络动态特性,在通信、控制、生物等领域起着重要的作用.谱粗粒化方法是一种在保持原始网络的同步能力尽量不变情况下将大规模网络约简为小规模网络的算法.此方法在对约简节点分类时是以每个节点对应特征向量分量间的绝对距离作为判断标准,在实际运算中计算量大,可执行性较差.本文提出了一种以特征向量分量间相对距离作为分类标准的谱粗粒化改进算法,能够使节点的合并更加合理,从而更好地保持原始网络的同步能力.通过经典的三种网络模型(BA无标度网络、ER随机网络、NW小世界网络)和27种不同类型实际网络的数值仿真分析表明,本文提出的算法对比原来的算法能够明显改善网络的粗粒化效果,并发现互联网、生物、社交、合作等具有明显聚类结构的网络在采用谱粗粒化算法约简后保持同步的能力要优于电力、化学等模糊聚类结构的网络.     

Synchronization in complex clustered networks

Synchronization in complex networks has been an active area of research in recent years. While much effort has been devoted to networks with the small-world and scale-free topology, structurally they are often assumed to have a single, densely connected component. Recently it has also become apparent that many networks in social, biological, and technological systems are clustered, as characterized by a number (or a hierarchy) of sparsely linked clusters, each with dense and complex internal connections. Synchronization is fundamental to the dynamics and functions of complex clustered networks, but this problem has just begun to be addressed. This paper reviews some progress in this direction by focusing on the interplay between the clustered topology and network synchronizability. In particular, there are two parameters characterizing a clustered network: the intra-cluster and the inter-cluster link density. Our goal is to clarify the roles of these parameters in shaping network synchronizability. By using theoretical analysis and direct numerical simulations of oscillator networks, it is demonstrated that clustered networks with random inter-cluster links are more synchronizable, and synchronization can be optimized when inter-cluster and intra-cluster links match. The latter result has one counterintuitive implication: more links, if placed improperly, can actually lead to destruction of synchronization, even though such links tend to decrease the average network distance. It is hoped that this review will help attract attention to the fundamental problem of clustered structures/synchronization in network science.      

Synchronization in small-world systems

We quantify the dynamical implications of the small-world phenomenon by considering the generic synchronization of oscillator networks of arbitrary topology. The linear stability of the synchronous state is linked to an algebraic condition of the Laplacian matrix of the network. Through numerics and analysis, we show how the addition of random shortcuts translates into improved network synchronizability. Applied to networks of low redundancy, the small-world route produces synchronizability more efficiently than standard deterministic graphs, purely random graphs, and ideal constructive schemes. However, the small-world property does not guarantee synchronizability: the synchronization threshold lies within the boundaries, but linked to the end of the small-world region.     

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 λ₂.     

Error and attack tolerance of synchronization in Hindmarsh–Rose neural networks with community structure

Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh–Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.     

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

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

簇间连接方式不同的簇网络的同步过程研究

本文对簇间连接方式不同的三类簇网络的同步能力和同步过程进行研究. 构成簇网络的两个子网均为BA无标度网络, 当簇间连接方式是双向耦合时, 称其为TWD网络模型, 当簇间连接是大子网驱动小子网时, 称其为BDS网络模型, 当簇间连接是小子网驱动大子网时, 称其为SDB网络模型. 研究表明, 当小子网和大子网节点数目的比值大于某一临界值时, TWD网络模型的同步能力大于BDS网络模型的同步能力, 当该比值小于某一临界值时, TWD网络模型的同步能力小于BDS网络模型的同步能力, SDB网络模型的同步能力是三种网络结构中最差的. 对于簇间连接具有方向性的单向驱动网络, 簇网络的整体同步能力与被驱动子网的节点数和簇间连接数有关, 与驱动网络自身节点数无关. 增加簇间连接数在开始时会降低各子网的同步速度, 但最终各子网到达完全同步的时间减少, 网络的整体同步能力增强. 文中以Kuramoto相振子作为网络节点, 研究了不同情况下三种簇网络的同步过程, 证明了所得结论的正确性. 关键词： 簇网络 有向连接 同步能力 Kuramoto振子     

Optimization of synchronization in complex clustered networks

There has been mounting evidence that many types of biological or technological networks possess a clustered structure. As many system functions depend on synchronization, it is important to investigate the synchronizability of complex clustered networks. Here we focus on one fundamental question: Under what condition can the network synchronizability be optimized? In particular, since the two basic parameters characterizing a complex clustered network are the probabilities of intercluster and intracluster connections, we investigate, in the corresponding two-dimensional parameter plane, regions where the network can be best synchronized. Our study yields a quite surprising finding: a complex clustered network is most synchronizable when the two probabilities match each other approximately. Mismatch, for instance caused by an overwhelming increase in the number of intracluster links, can counterintuitively suppress or even destroy synchronization, even though such an increase tends to reduce the average network distance. This phenomenon provides possible principles for optimal synchronization on complex clustered networks. We provide extensive numerical evidence and an analytic theory to establish the generality of this phenomenon.     

Altering synchronizability by adding and deleting edges for scale-free networks

In this paper we propose two methods for altering the synchronizability of scale-free networks: (1) adding edges between the max-degree nodes and min-degree nodes; (2) deleting edges between the max-degree nodes and max-degree nodes. After adding and deleting edges, we find that the former, adding process can weaken synchronizability, while the latter, deleting process can enhance it; the two processes (adding and deleting) can preserve the scale-free structure; the study of the average clustering coefficient indicates that it is not the most closely correlated with the synchronizability among the topological features considered. Our work also suggests that there are some essential relations between the network synchronization and the dynamics of economic systems. They can be used to deal with some problems in the real world, such as relieving the economic crisis. In addition, the adding and deleting processes may have potential applications in modifying network structure, in view of their low cost.     

Synchronization in complex delayed dynamical networks with nonsymmetric coupling

A new general complex delayed dynamical network model with nonsymmetric coupling is introduced, and then we investigate its synchronization phenomena. Several synchronization criteria for delay-independent and delay-dependent synchronization are provided which generalize some previous results. The matrix Jordan canonical formalization method is used instead of the matrix diagonalization method, so in our synchronization criteria, the coupling configuration matrix of the network does not required to be diagonalizable and may have complex eigenvalues. Especially, we show clearly that the synchronizability of a delayed dynamical network is not always characterized by the second-largest eigenvalue even though all the eigenvalues of the coupling configuration matrix are real. Furthermore, the effects of time-delay on synchronizability of networks with unidirectional coupling are studied under some typical network structures. The results are illustrated by delayed networks in which each node is a two-dimensional limit cycle oscillator system consisting of a two-cell cellular neural network, numerical simulations show that these networks can realize synchronization with smaller time-delay, and will lose synchronization when the time-delay increase larger than a threshold.     

两层星形网络的特征值谱及同步能力

多层网络是当今网络科学研究的一个前沿方向.本文深入研究了两层星形网络的特征值谱及其同步能力的问题.通过严格导出的两层星形网络特征值的解析表达式,分析了网络的同步能力与节点数、层间耦合强度和层内耦合强度的关系.当同步域无界时,网络的同步能力只与叶子节点之间的层间耦合强度和网络的层内耦合强度有关;当叶子节点之间的层间耦合强度比较弱时,同步能力仅依赖于叶子节点之间的层间耦合强度;而当层内耦合强度比较弱时,同步能力依赖于层内耦合强度;当同步域有界时,节点数、层间耦合强度和层内耦合强度对网络的同步能力都有影响.当叶子节点之间的层间耦合强度比较弱时,增大叶子节点之间的层间耦合强度会增强网络的同步能力,而节点数、中心节点之间的层间耦合强度和层内耦合强度的增大反而会减弱网络的同步能力;而当层内耦合强度比较弱时,增大层内耦合强度会增强网络的同步能力,而节点数、层间耦合强度的增大会减弱网络的同步能力.进一步,在层间和层内耦合强度都相同的基础上,讨论了如何改变耦合强度更有利于同步.最后,对两层BA无标度网络进行数值仿真,得到了与两层星形网络非常类似的结论.     

Synchronizing distant nodes: a universal classification of networks

Stability of synchronization in delay-coupled networks of identical units generally depends in a complicated way on the coupling topology. We show that for large coupling delays synchronizability relates in a simple way to the spectral properties of the network topology. The master stability function used to determine the stability of synchronous solutions has a universal structure in the limit of large delay: It is rotationally symmetric around the origin and increases monotonically with the radius in the complex plane. This allows a universal classification of networks with respect to their synchronization properties and solves the problem of complete synchronization in networks with strongly delayed coupling.     

一类高聚类系数的加权无标度网络及其同步能力分析

针对真实世界中大规模网络都具有明显聚类效应的特点, 提出一类具有高聚类系数的加权无标度网络演化模型, 该模型同时考虑了优先连接、三角结构、随机连接和社团结构等四种演化机制. 在模型演化规则中, 以概率p增加单个节点, 以概率1–p增加一个社团. 与以往研究的不同在于新边的建立, 以概率φ在旧节点之间进行三角连接, 以概率1–φ进行随机连接. 仿真分析表明, 所提出的网络度、强度和权值分布都是服从幂律分布的形式, 且具有高聚类系数的特性, 聚类系数的提高与社团结构和随机连接机制有直接的关系. 最后通过数值仿真分析了网络演化机制对同步动态特性的影响, 数值仿真结果表明, 网络的平均聚类系数越小, 网络的同步能力越强. 关键词： 无标度网络 加权网络 聚类系数 同步能力     

多层单向耦合星形网络的特征值谱及同步能力分析

随着复杂网络同步的进一步发展,对复杂网络的研究重点由单层网络转向更加接近实际网络的多层有向网络.本文分别严格推导出三层、多层的单向耦合星形网络的特征值谱,并分析了耦合强度、节点数、层数对网络同步能力的影响,重点分析了层数和层间中心节点之间的耦合强度对多层单向耦合星形网络同步能力的影响,得出了层数对多层网络同步能力的影响至关重要.当同步域无界时,网络的同步能力与耦合强度、层数有关,同步能力随其增大而增强;当同步域有界时,对于叶子节点向中心节点耦合的多层星形网络,当层内耦合强度较弱时,层内耦合强度的增大会使同步能力增强,而层间叶子节点之间的耦合强度、层数的增大反而会使同步能力减弱;当层间中心节点之间的耦合强度较弱时,层间中心节点之间的耦合强度、层数的增大会使同步能力增强,层内耦合强度、层间叶子节点之间的耦合强度的增大反而会使同步能力减弱.对于中心节点向叶子节点耦合的多层星形网络,层间叶子节点之间的耦合强度、层数的增大会使同步能力增强,层内耦合强度、节点数、层间中心节点之间的耦合强度的增大反而会使同步能力减弱.     

Synchronization in complex dynamical networks with nonsymmetric coupling

Based on the work of Nishikawa and Motter, who have extended the well-known master stability framework to include non-diagonalizable cases, we develop another extension of the master stability framework to obtain criteria for global synchronization. Several criteria for global synchronization are provided which generalize some previous results. The Jordan canonical transformation method is used in stead of the matrix diagonalization method. Especially, we show clearly that, the synchronizability of a dynamical network with nonsymmetric coupling is not always characterized by its second-largest eigenvalue, even though all the eigenvalues of the nonsymmetric coupling matrix are real. Furthermore, the effects of the asymmetry of coupling on synchronizability of networks with different structures are analyzed. Numerical simulations are also done to illustrate and verify the theoretical results on networks in which each node is a dynamical limit cycle oscillator consisting of a two-cell cellular neural network.     

非线性网络的动力学复杂性研究

综述了非线性网络的动力学复杂性研究在网络理论、实证和应用方面所取得的主要进展和重要成果;深刻揭示了复杂网络的若干复杂性特征与基本定量规律;提出和建立了网络科学的统一混合理论体系(三部曲)和网络金字塔,并引入一类广义Farey组织的网络家族,阐明网络的复杂性-简单性与多样性-普适性之间转变关系;揭示了网络的拓扑结构特征与网络的动态特性之间关系;建立具有长程连接的规则网络的部分同步理论并应用于随机耦合的时空非线性系统的同步;提出复杂网络的动力学同步与控制多种方法;提出若干提高同步能力的模型、方法和途径,如同步最优和同步优先模型、同步与网络特征量关系、权重作用、叶子节点影响等;提出复杂混沌网络的多目标控制及具有小世界和无标度拓扑的束流输运网络的束晕-混沌控制方法;提出集群系统的自适应同步模型及蜂拥控制方法;探讨网络上拥塞与路由控制、资源博弈及不同类型网络上传播的若干规律;揭示含权经济科学家合作网及其演化特点;实证研究并揭示了多层次的高科技企业网和若干社会网络的特点;提出一种复杂网络的非平衡统计方法,把宏观网络推进到微观量子网络。     

A general fractional-order dynamical network: synchronization behavior and state tuning

A general fractional-order dynamical network model for synchronization behavior is proposed. Different from previous integer-order dynamical networks, the model is made up of coupled units described by fractional differential equations, where the connections between individual units are nondiffusive and nonlinear. We show that the synchronous behavior of such a network cannot only occur, but also be dramatically different from the behavior of its constituent units. In particular, we find that simple behavior can emerge as synchronized dynamics although the isolated units evolve chaotically. Conversely, individually simple units can display chaotic attractors when the network synchronizes. We also present an easily checked criterion for synchronization depending only on the eigenvalues distribution of a decomposition matrix and the fractional orders. The analytic results are complemented with numerical simulations for two networks whose nodes are governed by fractional-order Lorenz dynamics and fractional-order Ro?ssler dynamics, respectively.     

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.