首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 93 毫秒
1.
Yanli Zou  Guanrong Chen 《Physica A》2009,388(14):2931-2940
Previous studies concerning pinning control of complex-network synchronization have very often demonstrated that in an unweighted symmetrical scale-free network, controlling the high-degree nodes is more efficient than controlling randomly chosen ones; due to the heterogeneity of the node-degree or edge-connection distribution of the scale-free network, small-degree nodes have relatively high probabilities of being chosen at random but their control has less influence on the other nodes through the network. This raises the question of whether or not controlling the high-degree nodes is always better than controlling the small ones in scale-free networks. Our answer to this is yes and no. In this study, we carry out extensive numerical simulations to show that in an unweighted symmetrical Barabasi-Albert scale-free network, when the portion of controlled nodes is relatively large, controlling the small nodes becomes better than controlling the big nodes and controlling randomly chosen nodes has approximately the same effect as controlling the big ones. However, we also show that for normalized weighted scale-free networks, controlling the big nodes is in fact always better than controlling the small ones.  相似文献   

2.
梁义  王兴元 《物理学报》2012,61(3):38901-038901
虽已对复杂网络牵制同步需要牵制结点数量及牵制结点数量与耦合强度的关系进行了研究,然而快速计算牵制结点数量仍是大规模复杂网络面临的一个重要问题.研究发现了复杂网络耦合矩阵主子阵最大值递减规律,由此提出了快速计算复杂网络牵制结点数量的方法,揭示了不同的牵制策略与牵制结点数量之间的关系.数值仿真显示了在无标度网络和小世界网络上三种不同的牵制策略下,牵制结点数与主子阵最大特征值的变化规律;最后给出了一个在无标度网络上采用随机选择结点策略的牵制同步实例.  相似文献   

3.
In this paper, pinning synchronization on directed network was considered. By analyzing, some general synchronization criteria on directed network were established. And then, we verified it on directed globally coupled network, directed scale-free network, and directed small-world network, respectively. The pinning nodes were selected, respectively, according to order of in-degrees and out-degrees. Through comparing and analyzing simulations, the optimal pinning scheme was found, and a practical principle was induced finally.  相似文献   

4.
YI LIANG  XINGYUAN WANG 《Pramana》2013,80(4):593-606
It is proved that the maximum eigenvalue sequence of the principal submatrices of coupling matrix is decreasing. The method of calculating the number of pinning nodes is given based on this theory. The findings reveal the relationship between the decreasing speed of maximum eigenvalue sequence of the principal submatrices for coupling matrix and the synchronizability on complex networks via pinning control. We discuss the synchronizability on some networks, such as scale-free networks and small-world networks. Numerical simulations show that different pinning strategies have different pinning synchronizability on the same complex network, and the consistence between the synchronizability with pinning control and one without pinning control in various complex networks.  相似文献   

5.
Complex dynamical networks are being studied across many fields of science and engineering today. The issue of controlling a network to the desired state has attracted increasing attention. In this Letter, we investigate the problem of pinning a complex dynamical network to the solution of an uncoupled system. Our strategy is to apply impulsive control to a small fraction of network nodes. Based on the Lyapunov stability theory, we prove that the theoretical results derived here are effective. In addition, a B-A scale-free network with 20 nodes is taken for illustration and verification.  相似文献   

6.
Mahdi Jalili 《Physica A》2011,390(23-24):4588-4595
In this paper the robustness of network synchronizability against random deletion of nodes, i.e. errors, in dynamical scale-free networks was studied. To this end, two measures of network synchronizability, namely, the eigenratio of the Laplacian and the order parameter quantifying the degree of phase synchrony were adopted, and the synchronizability robustness on preferential attachment scale-free graphs was investigated. The findings revealed that as the network size decreases, the robustness of its synchronizability against random removal of nodes declines, i.e. the more the number of randomly removed nodes from the network, the worse its synchronizability. We also showed that this dependence of the synchronizability on the network size is different with that in the growing scale-free networks. The profile of a number of network properties such as clustering coefficient, efficiency, assortativity, and eccentricity, as a function of the network size was investigated in these two cases, growing scale-free networks and those with randomly removed nodes. The results showed that these processes are also different in terms of these metrics.  相似文献   

7.
刘锋  赵寒  李明  任丰原  朱衍波 《中国物理 B》2010,19(4):40513-040513
Due to the heterogeneity of the structure on a scale-free network,making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult.In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination,an adaptive local routing strategy on a scale-free network is proposed,in which the node adjusts the forwarding probability with the dynamical traffic load(packet queue length) and the degree distribution of neighbouring nodes.The critical queue length of a node is set to be proportional to its degree,and the node with high degree has a larger critical queue length to store and forward more packets.When the queue length of a high degree node is shorter than its critical queue length,it has a higher probability to forward packets.After higher degree nodes are saturated(whose queue lengths are longer than their critical queue lengths),more packets will be delivered by the lower degree nodes around them.The adaptive local routing strategy increases the probability of a packet finding its destination quickly,and improves the transmission capacity on the scale-free network by reducing routing hops.The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.  相似文献   

8.
刘兆冰  张化光  孙秋野 《中国物理 B》2010,19(9):90506-090506
This paper considers the global stability of controlling an uncertain complex network to a homogeneous trajectory of the uncoupled system by a local pinning control strategy. Several sufficient conditions are derived to guarantee the network synchronisation by investigating the relationship among pinning synchronisation, network topology, and coupling strength. Also, some fundamental and yet challenging problems in the pinning control of complex networks are discussed: (1) what nodes should be selected as pinned candidates? (2) How many nodes are needed to be pinned for a fixed coupling strength? Furthermore, an adaptive pinning control scheme is developed. In order to achieve synchronisation of an uncertain complex network, the adaptive tuning strategy of either the coupling strength or the control gain is utilised. As an illustrative example, a network with the Lorenz system as node self-dynamics is simulated to verify the efficacy of theoretical results.  相似文献   

9.
In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts–Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts–Strogatz networks could not significantly change the consensus profile.  相似文献   

10.
We introduce a novel model for robustness of complex with a tunable attack information parameter. The random failure and intentional attack known are the two extreme cases of our model. Based on the model, we study the robustness of complex networks under random information and preferential information, respectively. Using the generating function method, we derive the exact value of the critical removal fraction of nodes for the disintegration of networks and the size of the giant component. We show that hiding just a small fraction of nodes randomly can prevent a scale-free network from collapsing and detecting just a small fraction of nodes preferentially can destroy a scale-free network.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号