共查询到20条相似文献,搜索用时 109 毫秒
1.
Ido Kanter Evi Kopelowitz Roni Vardi Meital Zigzag Dana Cohen Wolfgang Kinzel 《Journal of statistical physics》2011,145(3):713-733
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. 相似文献
2.
Fumito Mori 《Physica D: Nonlinear Phenomena》2009,238(14):1180-1185
We investigate the synchronous dynamics of Kuramoto oscillators and van der Pol oscillators on Watts-Strogatz type small-world networks. The order parameters to characterize macroscopic synchronization are calculated by numerical integration. We focus on the difference between frequency synchronization and phase synchronization. In both oscillator systems, the critical coupling strength of the phase order is larger than that of the frequency order for the small-world networks. The critical coupling strength for the phase and frequency synchronization diverges as the network structure approaches the regular one. For the Kuramoto oscillators, the behavior can be described by a power-law function and the exponents are obtained for the two synchronizations. The separation of the critical point between the phase and frequency synchronizations is found only for small-world networks in the theoretical models studied. 相似文献
3.
By numerical simulations, we investigate the onset of synchronization of networked phase oscillators under two different weighting schemes. In scheme-I, the link weights are correlated to the product of the degrees of the connected nodes, so this kind of networks is named as the weight-degree correlated (WDC) network. In scheme-II, the link weights are randomly assigned to each link regardless of the node degrees, so this kind of networks is named as the weight-degree uncorrelated (WDU) network. Interestingly, it is found that by increasing a parameter that governs the weight distribution, the onset of synchronization in WDC network is monotonically enhanced, while in WDU network there is a reverse in the synchronization performance. We investigate this phenomenon from the viewpoint of gradient network, and explain the contrary roles of coupling gradient on network synchronization: gradient promotes synchronization in WDC network, while deteriorates synchronization in WDU network. The findings highlight the fact that, besides the link weight, the correlation between the weight and the node degree is also important to the network dynamics. 相似文献
4.
Synchronization between two networks with different topology structures and different dynamical behaviours is studied. These two different networks are driving and responding networks, respectively. Under the preconditions that the driving network gets synchronization, we give the conditions for the responding network to be synchronized to the same dynamics as the driving network with the help of the open-plus-closed-loop method. Then a example is given to verify the validity of the theoretical results. 相似文献
5.
Adaptive synchronization between two complex networks with nonidentical topological structures 总被引:1,自引:0,他引:1
This paper addresses the theoretical analysis of synchronization between two complex networks with nonidentical topological structures. By designing effective adaptive controllers, we achieve synchronization between two complex networks. Both the cases of identical and nonidentical network topological structures are considered and several useful criteria for synchronization are given. Illustrative examples are presented to demonstrate the application of the theoretical results. 相似文献
6.
This paper investigates outer synchronization of complex networks, especially, outer complete synchronization and outer anti-synchronization between the driving network and the response network. Employing the impulsive control method which is uncontinuous, simple, efficient, low-cost and easy to implement in practical applications, we obtain some sufficient conditions of outer complete synchronization and outer anti-synchronization between two complex networks. Numerical simulations demonstrate the effectiveness of the proposed impulsive control scheme. 相似文献
7.
We study synchrony optimized networks. In particular, we focus on the Kuramoto model with non-identical native frequencies on a random graph. In a first step, we generate synchrony optimized networks using a dynamic breeding algorithm, whereby an initial network is successively rewired toward increased synchronization. These networks are characterized by a large anti-correlation between neighbouring frequencies. In a second step, the central part of our paper, we show that synchrony optimized networks can be generated much more cost efficiently by minimization of an energy-like quantity E and subsequent random rewires to control the average path length. We demonstrate that synchrony optimized networks are characterized by a balance between two opposing structural properties: A large number of links between positive and negative frequencies of equal magnitude and a small average path length. Remarkably, these networks show the same synchronization behaviour as those networks generated by the dynamic rewiring process. Interestingly, synchrony-optimized network also exhibit significantly enhanced synchronization behaviour for weak coupling, below the onset of global synchronization, with linear growth of the order parameter with increasing coupling strength. We identify the underlying dynamical and topological structures, which give rise to this atypical local synchronization, and provide a simple analytical argument for its explanation. 相似文献
8.
Huang Liang Lai Ying-Cheng Kwangho Park Wang Xingang Lai Choy Heng Robert A. Gatenby 《Frontiers of Physics in China》2007,2(4):446-459
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.
相似文献
9.
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 λ2 of the Laplacian matrix of
the network which supports the previous result that the
synchronization speed is determined by the value of λ2. 相似文献
10.
Enhancing the network synchronizability 总被引:1,自引:0,他引:1
The structural and dynamical properties, particularly the small-world effect and scale-free feature, of complex networks have
attracted tremendous interest and attention in recent years. This article offers a brief review of one focal issue concerning
the structural and dynamical behaviors of complex network synchronization. In the presentation, the notions of synchronization
of dynamical systems on networks, stability of dynamical networks, and relationships between network structure and synchronizability,
will be first introduced. Then, various technical methods for enhancing the network synchronizability will be discussed, which
are roughly divided into two classes: Structural Modification and Coupling-Pattern Regulation, where the former includes three
typical methods—dividing hub nodes, shortening average distances, and deleting overload edges, while the latter mainly is
a method of strengthening the hub-nodes’ influence on the network.
相似文献
11.
12.
针对由两个子网络构成的耦合含时滞的相互依存网络,研究其局部自适应异质同步问题.时滞同时存在于两个子网络的内部耦合项和子网络间的一对一相互依赖耦合项中,且网络的耦合关系满足非线性特性和光滑性.基于李雅普诺夫稳定性理论、线性矩阵不等式方法和自适应控制技术,通过对子网络设置合适的控制器,提出了使得相互依存网络的子网络分别同步到异质孤立系统的充分条件.针对小世界网络和无标度网络构成的相互依存网络进行数值模拟,验证了提出理论的正确性和有效性. 相似文献
13.
时滞和噪声在复杂网络中普遍存在,而含有耦合时滞和噪声摄动的耦合网络同步的研究工作却极其稀少. 本文针对噪声环境下具有不同节点动力学、不同拓扑结构及不同节点数目的耦合时滞网络,提出了两个网络之间的广义投影滞后同步. 首先,构建了更加贴近现实的驱动-响应网络同步的理论框架;其次,基于随机时滞微分方程LaSalle不变性原理,严格证明了在合理的控制器作用下,驱动网络和响应网络在几乎必然渐近稳定性意义下能够取得广义投影滞后同步;最后,借助于计算机仿真,通过具体的网络模型验证了理论推理的有效性. 数值模拟结果表明,驱动网络与响应网络不但能够达到广义投影滞后同步,而且同步效果不依赖于耦合时滞和比例因子的选取,同时也揭示了更新增益和耦合时滞对同步收敛速度的显著性影响.
关键词:
复杂网络
广义投影滞后同步
随机噪声
时滞 相似文献
14.
In this paper we briefly report some recent developments on generalized synchronization. We discuss different methods of detecting generalized synchronization. We first consider two unidirectionally coupled systems and then two mutually coupled systems. We then extend the study to a network of coupled systems. In the study of generalized synchronization of coupled nonidentical systems we discuss the Master Stability Function (MSF) formalism for coupled nearly identical systems. Later we use this MSF to construct synchronized optimized networks. In the optimized networks the nodes which have parameter value at one extreme are chosen as hubs and the pair of nodes with larger difference in parameter are chosen to create links. 相似文献
15.
针对同时具有节点时滞和耦合时滞的时变耦合复杂网络的外同步问题, 提出一种简单有效的自适应牵制控制方法. 首先构建一种贴近实际的驱动-响应复杂网络模型, 在模型中引入双重时滞和时变不对称外部耦合矩阵. 进一步设计易于实现的自适应牵制控制器, 对网络中的一部分关键节点进行控制. 构造适当的Lyapunov泛函, 利用 LaSalle不变集原理和线性矩阵不等式, 给出两个复杂网络实现外同步的充分条件. 最后, 仿真结果表明所提同步方法的有效性, 同时揭示耦合时滞对同步收敛速度的影响. 相似文献
16.
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. 相似文献
17.
Adaptive Synchronization between Two Different Complex Networks with Time-Varying Delay Coupling
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A new general network model for two complex networks with time-varying delay coupling is presented. Then we investigate its synchronization phenomena. The two complex networks of the model differ in dynamic nodes, the number of nodes and the coupling connections. By using adaptive controllers, a synchronization criterion is derived. Numerical examples are given to demonstrate the effectiveness of the obtained synchronization criterion. This study may widen the application range of synchronization, such as in chaotic secure communication. 相似文献
18.
本文对簇间连接方式不同的三类簇网络的同步能力和同步过程进行研究. 构成簇网络的两个子网均为BA无标度网络, 当簇间连接方式是双向耦合时, 称其为TWD网络模型, 当簇间连接是大子网驱动小子网时, 称其为BDS网络模型, 当簇间连接是小子网驱动大子网时, 称其为SDB网络模型. 研究表明, 当小子网和大子网节点数目的比值大于某一临界值时, TWD网络模型的同步能力大于BDS网络模型的同步能力, 当该比值小于某一临界值时, TWD网络模型的同步能力小于BDS网络模型的同步能力, SDB网络模型的同步能力是三种网络结构中最差的. 对于簇间连接具有方向性的单向驱动网络, 簇网络的整体同步能力与被驱动子网的节点数和簇间连接数有关, 与驱动网络自身节点数无关. 增加簇间连接数在开始时会降低各子网的同步速度, 但最终各子网到达完全同步的时间减少, 网络的整体同步能力增强. 文中以Kuramoto相振子作为网络节点, 研究了不同情况下三种簇网络的同步过程, 证明了所得结论的正确性.
关键词:
簇网络
有向连接
同步能力
Kuramoto振子 相似文献
19.
We investigate a new generalized projective synchronization between two complex dynamical networks of different sizes. To the best of our knowledge, most of the current studies on projective synchronization have dealt with coupled networks of the same size. By generalized projective synchronization, we mean that the states of the nodes in each network can realize complete synchronization, and the states of a pair of nodes from both networks can achieve projective synchronization. Using the stability theory of the dynamical system, several sufficient conditions for guaranteeing the existence of the generalized projective synchronization under feedback control and adaptive control are obtained. As an example, we use Chua's circuits to demonstrate the effectiveness of our proposed approach. 相似文献
20.
This paper introduces the concept of
hierarchical-control-based output synchronization of coexisting
attractor networks. Within the new framework, each dynamic node is
made passive at first utilizing intra-control around its own arena.
Then each dynamic node is viewed as one agent, and on account of
that, the solution of output synchronization of coexisting attractor
networks is transformed into a multi-agent consensus problem, which
is made possible by virtue of local interaction between individual
neighbours; this distributed working way of coordination is coined
as inter-control, which is only specified by the topological
structure of the network. Provided that the network is connected and
balanced, the output synchronization would come true naturally via
synergy between intra and inter-control actions, where the
rightness is proved theoretically via convex composite Lyapunov
functions. For completeness, several illustrative examples are
presented to further elucidate the novelty and efficacy of the
proposed scheme. 相似文献