Enhancing robustness and synchronizability of networks homogenizing their degree distribution

A new family of networks, called entangled, has recently been proposed in the literature. These networks have optimal properties in terms of synchronization, robustness against errors and attacks, and efficient communication. They are built with an algorithm which uses modified simulated annealing to enhance a well-known measure of networks’ ability to reach synchronization among nodes. In this work, we suggest that a class of networks similar to entangled networks can be produced by changing some of the connections in a given network, or by just adding a few connections. We call this class of networks weak-entangled. Although entangled networks can be considered as a subset of weak-entangled networks, we show that both classes share similar properties, especially with respect to synchronization and robustness, and that they have similar structural properties.     

Evolving networks with bimodal degree distribution

Networks with bimodal degree distribution are most robust to targeted and random attacks. We present a model for constructing a network with bimodal degree distribution. The procedure adopted is to add nodes to the network with a probability p and delete the links between nodes with probability (1 − p). We introduce an additional constraint in the process through an immunity score, which controls the dynamics of the growth process based on the feedback value of the last few time steps. This results in bimodal nature for the degree distribution. We study the standard quantities which characterize the networks, like average path length and clustering coefficient in the context of our growth process and show that the resultant network is in the small world family. It is interesting to note that bimodality in degree distribution is an emergent 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.     

简易广义合作网络度分布的稳定性

本文对简易广义合作网络的三类特殊情形（择优连接、随机连接、混合连接）进行了研究. 基于马氏链理论, 给出它们度分布稳定性存在的严格证明, 并且得到相应网络度分布和度指数的精确表达式. 特别地, 对于混合连接情况, 说明在连线方式中只要存在择优成分, 网络度分布就服从幂律分布, 即所得网络为无标度网络. 关键词： 简易广义合作网络 无标度网络 马氏链 度分布     

On the degree distribution of projected networks mapped from bipartite networks

Many real-world systems can be represented by bipartite networks. In a bipartite network, the nodes are divided into two disjoint sets, and the edges connect nodes that belong to different sets. Given a bipartite network (i.e. two-mode network) it is possible to construct two projected networks (i.e. one-mode networks) where each one is composed of only one set of nodes. While network analyses have focused on unipartite networks, considerably less attention has been paid to the analytical study of bipartite networks. Here, we analytically derive simple mathematical relationships that predict degree distributions of the projected networks by only knowing the structure of the original bipartite network. These analytical results are confirmed by computational simulations using artificial and real-world bipartite networks from a variety of biological and social systems. These findings offer in our view new insights into the structure of real-world bipartite networks.     

The degree distribution of fixed act-size collaboration networks

In this paper, we investigate a special evolving model of collaboration networks, where the act-size is fixed. Based on the first-passage probability of Markov chain theory, this paper provides a rigorous proof for the existence of a limiting degree distribution of this model and proves that the degree distribution obeys the power-law form with the exponent adjustable between 2 and 3.     

一个描述合作网络顶点度分布的模型

讨论一类社会合作网络以及一些与其拓扑结构相似的技术网络的度分布.建议一个最简化模型，通过解析的方法说明这些网络演化的共同动力学机理，而且说明顶点的度分布和项目度分布之间具有密切的一致关系，而项目所含的顶点数分布对度分布的影响较小；对模型的更一般情况进行数值模拟，说明上述结论具有一定的普遍性.这个模型显示这类广义的合作网络一般具有处于幂函数和指数函数这两种极端情况之间的度分布.简要介绍对一些实际合作网络做统计研究的结果，说明本模型的合理性. 关键词： 合作网络 度分布 项目度分布 项目含顶点数     

Synchronization for complex dynamical Lurie networks

This paper investigates the synchronization problem for two different complex dynamical Lurie networks, The first one is with constant coupling and the second one is with constant coupling and discrete-delay coupling. Based on contraction theory and matrix measure properties, some new delay-independent synchronization conditions depending on coupling strength and network topology are proposed. Finally, simulation results are presented to support the theoretical results.     

Adaptive synchronization for dynamical networks of neutral type with time-delay

This paper investigates adaptive synchronization for dynamical networks of neutral type with time-delay. In comparison with those of the existing synchronization of dynamical networks of neutral type with time-delay, we assume that the given neutral type expression can be linear function, nonlinear function, or even any elementary transformation. Based on the Lyapunov stability theorem, the adaptive control law is derived to make the state of two dynamical networks of neutral type synchronized. Some numerical are also given to show the effectiveness of the proposed method.     

Synchronization criteria for complex dynamical networks with neutral-type coupling delay

A generalized complex dynamical networks model with neutral-type coupling delay is proposed, which is an extension for the systems without time delay and with the retarded delay. By some transformation, the synchronization problem of the complex networks is transferred equally into the asymptotical stability problem of a group of uncorrelated neutral delay functional differential equations. Furthermore, the less conservative sufficient conditions for both delay-independent and delay-dependent asymptotical synchronization stability criteria are derived in the form of linear matrix inequalities based on the free weighting matrix strategy. Numerical examples are given to illustrate the theoretical results.     

Communication networks with an emergent dynamical structure

A model with a dynamical network structure is studied. The essential difference from other models is that a disappearance of links is also allowed. The obtained results suggest that under certain conditions a fairly robust cluster, which contains all of the elements of the system, can be formed. According to the power law dependence in the node connectivity distribution, a scale-free regime can occur in such models. The average network diameter behaves as K-tau. The emergent structure is close to the small-world networks for certain values of p and to the large-world ones for others. Generally, the influence of the parameter K on the average network diameter is more significant than that of the system size.     

Stochastic synchronization for time-varying complex dynamical networks

This paper studies the stochastic synchronization problem for time-varying complex dynamical networks. This model is totally different from some existing network models. Based on the Lyapunov stability theory, inequality techniques, and the properties of the Weiner process, some controllers and adaptive laws are designed to ensure achieving stochastic synchronization of a complex dynamical network model. A sufficient synchronization condition is given to ensure that the proposed network model is mean-square stable. Theoretical analysis and numerical simulation fully verify the main results.     

An extended clique degree distribution and its heterogeneity in cooperation-competition networks

After Xiao et al. [W.-K. Xiao, J. Ren, F. Qi, Z.W. Song, M.X. Zhu, H.F. Yang, H.Y. Jin, B.-H. Wang, Tao Zhou, Empirical study on clique-degree distribution of networks, Phys. Rev. E 76 (2007) 037102], in this article we present an investigation on so-called k-cliques, which are defined as complete subgraphs of k (k>1) nodes, in the cooperation-competition networks described by bipartite graphs. In the networks, the nodes named actors are taking part in events, organizations or activities, named acts. We mainly examine a property of a k-clique called “k-clique act degree”, q, defined as the number of acts, in which the k-clique takes part. Our analytic treatment on a cooperation-competition network evolution model demonstrates that the distribution of k-clique act degrees obeys Mandelbrot distribution, P(q)∝(q+α)^−γ. To validate the analytical model, we have further studied 13 different empirical cooperation-competition networks with the clique numbers k=2 and k=3. Empirical investigation results show an agreement with the analytic derivations. We propose a new “heterogeneity index”, H, to describe the heterogeneous degree distributions of k-clique and heuristically derive the correlation between H and α and γ. We argue that the cliques, which take part in the largest number of acts, are the most important subgraphs, which can provide a new criterion to distinguish important cliques in the real world networks.     

Synchronization criterion for Lur'e type complex dynamical networks with time-varying delay

In this Letter, the synchronization problem for a class of complex dynamical networks in which every identical node is a Lur'e system with time-varying delay is considered. A delay-dependent synchronization criterion is derived for the synchronization of complex dynamical network that represented by Lur'e system with sector restricted nonlinearities. The derived criterion is a sufficient condition for absolute stability of error dynamics between the each nodes and the isolated node. Using a convex representation of the nonlinearity for error dynamics, the stability condition based on the discretized Lyapunov-Krasovskii functional is obtained via LMI formulation. The proposed delay-dependent synchronization criterion is less conservative than the existing ones. The effectiveness of our work is verified through numerical examples.     

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.     

Synchronization of complex dynamical networks with time delays

In the present paper, two kinds of dynamical complex networks are considered. The first is that elements of every node have different time delays but all nodes in such networks have the same time-delay vector. The second is that different nodes have different time-delay vectors, and the elements of each node also have different time delays. Corresponding synchronization theorems are established. Numerical examples show the efficiency of the derived theorems.     

Synchronization of complex dynamical networks with nonidentical nodes

This Letter investigates the synchronization problem of a complex network with nonidentical nodes, and proposes two effective control schemes to synchronize the network onto any smooth goal dynamics. By applying open-loop control to all nodes and placing adaptive feedback injections on a small fraction of network nodes, a low-dimensional sufficient condition is derived to guarantee the global synchronization of the complex network with nonidentical nodes. By introducing impulsive effects to the open-loop controlled network, another synchronization scheme is developed for the network composed of nonidentical nodes, and an upper bound of impulsive intervals is estimated to ensure the global stability of the synchronization process. Numerical simulations are given to verify the theoretical results.