共查询到20条相似文献,搜索用时 31 毫秒
1.
It has been shown that synchronizability of a network is determined by the local structure rather than the global properties. With the same global properties, networks may have very different synchronizability. In this paper, we numerically studied, through the spectral properties, the synchronizability of ensembles of networks with prescribed statistical properties. Given a degree sequence, it is found that the eigenvalues and eigenratios characterizing network synchronizability have well-defined distributions, and statistically, the networks with extremely poor synchronizability are rare. Moreover, we compared the synchronizability of three network ensembles that have the same nodes and average degree. Our work reveals that the synchronizability of a network can be significantly affected by the local pattern of connections, and the homogeneity of degree can greatly enhance network synchronizability for networks of a random nature. 相似文献
2.
The influence of structural properties of a network on the network synchronizability is studied by introducing a new concept of average range of edges. For both small-world and scale-free networks, the effect of average range on the synchronizability of networks with bounded or unbounded synchronization regions is illustrated through numerical simulations. The relations between average range, range distribution, average distance, and maximum betweenness are also explored, revealing the effects of these factors on the network synchronizability of the small-world and scale-free networks, respectively. 相似文献
3.
4.
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network’s corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs. 相似文献
5.
DAI Kun WANG Xiao-Fan LI Xiang 《理论物理通讯》2008,49(4):1064-1068
In this paper, we propose two methods to enhance the synchronizability of a class of complex networks which do not hold the positive correlation between betweenness centrality (BC) and degree of a node, and observe other topology characteristics of the network affected by the methods. Numerical simulations show that both methods can effectively enhance the synchronizability of this kind of networks. Furthermore, we show that the maximal BC of all edges is an important factor to affect the network synchronizability, although it is not the unique factor. 相似文献
6.
《Physics letters. A》2014,378(18-19):1239-1248
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. 相似文献
7.
8.
多层网络是当今网络科学研究的一个前沿方向.本文深入研究了两层星形网络的特征值谱及其同步能力的问题.通过严格导出的两层星形网络特征值的解析表达式,分析了网络的同步能力与节点数、层间耦合强度和层内耦合强度的关系.当同步域无界时,网络的同步能力只与叶子节点之间的层间耦合强度和网络的层内耦合强度有关;当叶子节点之间的层间耦合强度比较弱时,同步能力仅依赖于叶子节点之间的层间耦合强度;而当层内耦合强度比较弱时,同步能力依赖于层内耦合强度;当同步域有界时,节点数、层间耦合强度和层内耦合强度对网络的同步能力都有影响.当叶子节点之间的层间耦合强度比较弱时,增大叶子节点之间的层间耦合强度会增强网络的同步能力,而节点数、中心节点之间的层间耦合强度和层内耦合强度的增大反而会减弱网络的同步能力;而当层内耦合强度比较弱时,增大层内耦合强度会增强网络的同步能力,而节点数、层间耦合强度的增大会减弱网络的同步能力.进一步,在层间和层内耦合强度都相同的基础上,讨论了如何改变耦合强度更有利于同步.最后,对两层BA无标度网络进行数值仿真,得到了与两层星形网络非常类似的结论. 相似文献
9.
随着复杂网络同步的进一步发展,对复杂网络的研究重点由单层网络转向更加接近实际网络的多层有向网络.本文分别严格推导出三层、多层的单向耦合星形网络的特征值谱,并分析了耦合强度、节点数、层数对网络同步能力的影响,重点分析了层数和层间中心节点之间的耦合强度对多层单向耦合星形网络同步能力的影响,得出了层数对多层网络同步能力的影响至关重要.当同步域无界时,网络的同步能力与耦合强度、层数有关,同步能力随其增大而增强;当同步域有界时,对于叶子节点向中心节点耦合的多层星形网络,当层内耦合强度较弱时,层内耦合强度的增大会使同步能力增强,而层间叶子节点之间的耦合强度、层数的增大反而会使同步能力减弱;当层间中心节点之间的耦合强度较弱时,层间中心节点之间的耦合强度、层数的增大会使同步能力增强,层内耦合强度、层间叶子节点之间的耦合强度的增大反而会使同步能力减弱.对于中心节点向叶子节点耦合的多层星形网络,层间叶子节点之间的耦合强度、层数的增大会使同步能力增强,层内耦合强度、节点数、层间中心节点之间的耦合强度的增大反而会使同步能力减弱. 相似文献
10.
W. L. Lu B. Liu T. Chen 《The European Physical Journal B - Condensed Matter and Complex Systems》2010,77(2):257-264
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. 相似文献
11.
Synchronization in complex networks with a modular structure 总被引:1,自引:0,他引:1
Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks. 相似文献
12.
In this article, we present a new type of unified dynamic scaling property for synchronizability, which can describe the scaling relationship between dynamic synehronizability and four hybrid ratios under the unified hybrid network theory framework (UHNTF). Our theory results can not only be applied to judge and analyze dynamic synehronizability for most of complex networks associated with the UHNTF, but also we can flexibly adjust and design different hybrid ratios and sealing exponent to meet actual requirement for the dynanfic characteristics of the UHNTF. 相似文献
13.
在不改变网络度分布的条件下,研究了推广的失活网络的同步行为. 应用特征值比R来衡量网络的同步能力,发现同步能力可以通过改变结构参数——激活节点数M来进行优化.特征值比R随M的变化非常敏感,激活节点数M越大,特征值比R越小,同步能力就越强,且在一定范围内遵循R~M-2.0的幂律关系.通过引入结构微扰,该网络的同步能力也可以得到有效优化.
关键词:
推广的失活网络
同步
特征值比
优化 相似文献
14.
Synchronization is an important phenomenon which occurs in the dynamics of complex systems. Synchronized states emerge both from an adjustment of the system parameters and from an application of a proper external stimulus. In the present paper we study synchronized activity in a neural network model whose dynamics is driven by an external activation. In this context we are interested in its synchronizability, i.e. the existence of inputs causing the model system to synchronize. Furthermore, we investigate global synchronizability properties of stochastic network structure ensembles (instead of single realizations of a network architecture). We study the small world network, a model of preferential linking structure, and the classical Erd?s-Renyi random graph as particular examples of network topologies. Their synchronizability properties are investigated by analytical arguments and numerical simulations. Our analysis shows the emergence of synchronizable states of network ensembles for a wide range of the parameter values. In addition we observe and study the transition behaviour from synchronizability to nonsynchronizability. 相似文献
15.
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. 相似文献
16.
In this paper, we present an algorithm for enhancing synchronizability of dynamical networks with prescribed degree distribution. The algorithm takes an unweighted and undirected network as input and outputs a network with the same node-degree distribution and enhanced synchronization properties. The rewirings are based on the properties of the Laplacian of the connection graph, i.e., the eigenvectors corresponding to the second smallest and the largest eigenvalues of the Laplacian. A term proportional to the eigenvectors is adopted to choose potential edges for rewiring, provided that the node-degree distribution is preserved. The algorithm can be implemented on networks of any sizes as long as their eigenvalues and eigenvectors can be calculated with standard algorithms. The effectiveness of the proposed algorithm in enhancing the network synchronizability is revealed by numerical simulation on a number of sample networks including scale-free, Watts-Strogatz, and Erdo?s-Re?nyi graphs. Furthermore, a number of network's structural parameters such as node betweenness centrality, edge betweenness centrality, average path length, clustering coefficient, and degree assortativity are tracked as a function of optimization steps. 相似文献
17.
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.
相似文献
18.
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. 相似文献
19.
Synchronization in small-world systems 总被引:5,自引:0,他引:5
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. 相似文献
20.
Y. Huang L. Wu S. Q. Zhu 《The European Physical Journal B - Condensed Matter and Complex Systems》2009,69(3):431-438
The interaction between the evolution of the game and the underlying network structure with evolving snowdrift game model
is investigated. The constructed network follows a power-law degree distribution typically showing scale-free feature. The
topological features of average path length, clustering coefficient, degree-degree correlations and the dynamical feature
of synchronizability are studied. The synchronizability of the constructed networks changes by the interaction. It will converge
to a certain value when sufficient new nodes are added. It is found
that initial payoffs of nodes greatly affect the synchronizability. When initial payoffs for players are equal, low common
initial payoffs may lead to more heterogeneity of the network and good
synchronizability. When initial payoffs follow certain distributions, better synchronizability is obtained compared to equal
initial payoff. The result is also true for phase synchronization of nonidentical oscillators. 相似文献