基于复杂网络理论的互联电网Braess悖论现象分析

为了探究互联电力网络中的Braess悖论现象, 采用二阶类Kuramoto相振子模型对电网进行动力学建模, 将两个子网通过大度节点相连构建互联电网。当两个子网间有功率传输时, 分别在两个子网内部新增传输线路探究互联电网发生Braess悖论现象的概率并分析其原因。研究发现: 当互联电网中两个子网间的功率传输达到某一临界值时, 受电子网的同步能力远优于供电子网的同步能力, 供电子网新增传输线路引起互联电网发生Braess悖论的概率远高于受电子网新增传输线路引发的Braess悖论概率。通过定义子网序参数对上述现象的产生进行深入分析。本研究对互联电网的拓扑优化具有重要意义。     

基于局部序参数的电网同步性能优化

采用类Kuramoto模型对电网中的节点进行建模,利用局部序参数描述节点的局部同步能力.研究发现相比小功率节点,大功率节点到其直接邻居节点更难达到同步.提出一种网络耦合强度的非均匀分配方法,在网络总耦合强度不变的情况下,增大大功率节点到其直接邻居节点的耦合强度以及相关节点对之间的连边耦合强度,减少其余节点对间的耦合强度.研究表明,这种方法可以在一定范围内降低电网的同步临界耦合强度,改善网络的同步性能;但当这种耦合强度的非均匀性过大时,网络的同步性能开始恶化.     

多个耦合星型网络的同步优化

本文讨论了星型网络中耦合Kuramoto振子的同步优化问题.分别考察具有随机频率分布叶子节点的单星型结构和多星型结构耦合网络达到同步所需的临界耦合强度.基于正弦函数的有界性导出的理论结果表明,单星型结构网络中,系统同步临界耦合强度与中心振子频率之间具有分段线性关系,而多星型结构耦合网络中,系统同步临界耦合强度与所有星型结构中心振子的频率之和保持分段线性关系.两种结构的网络的同步临界耦合强度最小值均在分段线性的转折点处.多星型结构耦合网络中,最小同步临界耦合强度出现在耦合系统只有一个同步集团的情形,而最大同步临界耦合强度出现在耦合系统有多个同步集团的情形.     

“Hopf/homoclinic”簇放电和“SubHopf/homoclinic"簇放电之间的同步

以修正过的Morris-Lecar神经元模型为例,讨论了“Hopf/homoclinic”簇放电和“SubHopf/homoclinic"簇放电之间的同步行为.首先,分别考察了同一拓扑类型的两个耦合簇放电神经元的同步行为,发现“Hopf/homoclinic”簇放电比“SubHopf/homoclinic”簇放电达到膜电位完全同步所需要的耦合强度小,即前者比后者更容易达到膜电位完全同步.其次,对这两个不同拓扑类型的簇放电神经元的耦合同步行为进行了讨论.通过数值分析发现随着耦合强度的增加,两种不同类型的簇放电首先达到簇放电同步,然后当耦合强度足够大时甚至可以达到膜电位完全同步,并且同步后的放电类型更接近容易同步的簇放电类型,即“Hopf/homoclinic”簇放电.然而令人奇怪的是此时慢变量并没有达到完全同步,而是相位同步;慢变量之间呈现为一种线性关系.这一点和现有文献的结果截然不同.     

固定关断时间控制Buck变换器输出电容等效串联电阻的稳定性分析

通过专用电力电子仿真软件进行电路仿真, 定性分析了固定关断时间(fixed off-time, FOT)控制Buck变换器输出电压相位滞后于电感电流相位的原因及其引发脉冲簇发现象的机理, 探讨了如何调整输出电容等效串联电阻(equivalent series resistance, ESR)的大小来消除这些复杂非线性现象, 并定量给出了FOT控制Buck变换器处于稳定工作状态时的ESR临界值.结果表明, 输出电容ESR对FOT控制Buck变换器工作状态的影响较大, 当ESR小于临界值时, 输出电压相位滞后于电感电流相位, 发生脉冲簇发现象;而当ESR大于临界值时, 输出电压与电感电流的变化保持同步, 脉冲簇发现象消失.通过描述函数法建立了参考电压至输出电压的传递函数, 由Routh-Hurwitz判据说明了ESR临界值是FOT控制Buck变换器的失稳条件.     

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

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

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

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

基于潮流追踪的电网同步性能优化及鲁棒性分析

采用二阶类Kuramoto模型对电网进行合理建模，分别应用临界同步耦合强度和平均同步误差来描述电网的同步能力和鲁棒性.研究发现，发电机的功率分配对线路的传输功率影响较大，而电网中高负荷线路越多，网络越难同步.基于这一发现，首先在发电机功率均匀分配（EG）方式下，计算出每条线路的传输功率，然后基于潮流追踪算法提出一种发电机功率非均匀分配（TG）方式，即在发电总量不变的情况下，增大枢纽发电机节点的功率，减小边缘发电机节点的功率.该发电机功率分配策略可以在一定程度上降低网络的临界同步耦合强度，减小平均同步误差，改善电网的同步性能和鲁棒性.     

基于动力中继的小世界复杂电机网络混沌同步控制

利用链式结构中间节点参数不匹配能降低两个非直接相连外部节点的同步耦合强度临界值,促进两节点同步的特性,对一个双向耦合的小世界电机网络进行同步控制.首先从外部增加参数不匹配的中继节点,通过动力中继降低整个网络的同步耦合强度阈值,从而促进整个电机网络的同步,然后分析动力中继如何作用于网络,最后用数值仿真验证该方法的有效性.     

推广的失活网络动力学同步优化

在不改变网络度分布的条件下,研究了推广的失活网络的同步行为. 应用特征值比R来衡量网络的同步能力,发现同步能力可以通过改变结构参数——激活节点数M来进行优化.特征值比R随M的变化非常敏感,激活节点数M越大,特征值比R越小,同步能力就越强,且在一定范围内遵循R～M^-2.0的幂律关系.通过引入结构微扰,该网络的同步能力也可以得到有效优化. 关键词： 推广的失活网络 同步 特征值比 优化     

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.      

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.     

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

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

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.     

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.     

Better synchronizability predicted by a new coupling method

In this paper, inspired by the idea that different nodes should play different roles in network synchronization, we bring forward a coupling method where the coupling strength of each node depends on its neighbors' degrees. Compared with the uniform coupled method and the recently proposed Motter-Zhou-Kurths method, the synchronizability of scale-free networks can be remarkably enhanced by using the present coupling method, and the highest network synchronizability is achieved at β=1 which is similar to a method introduced in [AIP Conf. Proc. 776, 201 (2005)].     

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.     

Are networks with more edges easier to synchronize,or not？

In this paper, the relationship between network synchronizability and the edge-addition of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network synchronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. Based on a subgraph and complementary graph method, it is shown by examples that the answer is negative even if the network structure is arbitrarily optimized. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, a simple example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.