On synchronizability and heterogeneity in unweighted networks

Synchronization in classes of continuous-time dynamical unweighted networks with different topologies is investigated. A synchronization-optimal network model based on rewiring of links is proposed. Compared with other networks, it exhibits a stronger synchronizability. We presented link density and investigated the correlation of synchronizability, link density and heterogeneity in degree distribution. In this work, it will be shown that synchronizability of Type I networks is independent of heterogeneity in the degree distribution when the link density is smaller than 0.02. Synchronizability and link density are proportional. When the link density is larger than 0.025, heterogeneity decides the curve slope. The synchronizability of Type II networks is drastically enhanced by enhancing the link density when the link density is smaller than 0.025. However synchronizability increases weakly by enhancing the link density when the link density is larger than 0.025.     

Structure properties and synchronizability of cobweb-like networks

The cobweb-like network was constructed, and its structure properties and synchronizability were studied by numerical simulation and probability theory. For cobweb-like networks, the behaviors of structure properties with the adding probability are similar to those for the small-world network. However, the properties of cobweb-like networks also distinctly depend on the spoke-ring ratio r. With increasing r, the average path length decreases, and the average clustering coefficient increases. Simultaneously, the connectivity distribution becomes heterogeneous. Moreover, in the case of bounded synchronized region, the synchronizability shows complicated behaviors with r, and is enhanced favorably at r=2.28 with homogeneous load distribution. The reason is that homogeneous load distribution has an advantage over the communication between oscillators, which efficiently leads to global synchronization. This work could be useful for design and kinetic property research of cobweb-like networks.     

Network synchronizability analysis: The theory of subgraphs and complementary graphs

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.     

Synchronization in weighted complex networks: Heterogeneity and synchronizability

Synchronization in different types of weighted networks based on a scale-free weighted network model is investigated. It has been argued that heterogeneity suppresses synchronization in unweighted networks [T. Nishikawa, A.E. Motter, Y.C. Lai, F.C. Hoppensteadt, Phys. Rev. Lett. 91 (2003) 014101]. However, it is shown in this work that as the network becomes more heterogeneous, the synchronizability of Type I symmetrically weighted networks, and Type I and Type II asymmetrically weighted networks is enhanced, while the synchronizability of Type II symmetrically weighted networks is weakened.     

Evolving model of weighted networks inspired by scientific collaboration networks

Inspired by scientific collaboration networks (SCN), especially our empirical analysis of econophysicists network, an evolutionary model for weighted networks is proposed. Besides a new vertex added in at every time step, old vertices can also attempt to build up new links, or to reconnect the existing links. The number of connections repeated between two nodes is converted into the weight of the link. This provides a natural way for the evolution of link weight. The path-dependent preferential attachment mechanism with local information is also introduced. It increases the clustering coefficient of the network significantly. The model shows the scale-free phenomena in degree and vertex weight distribution. It also gives well qualitatively consistent behavior with the empirical results.     

Average consensus of multi-agent systems with communication time delays and noisy links

In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies:fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.     

双向耦合混沌系统广义同步

提出了用条件熵来测定双向耦合混沌系统的广义同步，随着耦合强度的增大，当条件熵有一突出的最小值出现时表明两系统达到广义同步.为了证明这种方法的有效性，将这种方法用 于Rssler-Lorenz与Rssler-Rssler混沌系统的双向耦合情况，数值模拟结果表明该方 法非常有效且具有较强的鲁棒性. 关键词： 广义同步 双向耦合 条件熵     

Enhancing the synchronizability of networks by rewiring based on tabu search and a local greedy algorithm

By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.     

A model of the effects of authority on consensus formation in adaptive networks: Impact on network topology and robustness

Opinions of individuals in real social networks are arguably strongly influenced by external determinants, such as the opinions of those perceived to have the highest levels of authority. In order to model this, we have extended an existing model of consensus formation in an adaptive network by the introduction of a parameter representing each agent’s level of ‘authority’, based on their opinion relative to the overall opinion distribution. We found that introducing this model, along with a randomly varying opinion convergence factor, significantly impacts the final state of converged opinions and the number of interactions required to reach that state. We also determined the relationship between initial and final network topologies for this model, and whether the final topology is robust to node removals. Our results indicate firstly that the process of consensus formation with a model of authority consistently transforms the network from an arbitrary initial topology to one with distinct measurements in mean shortest path, clustering coefficient, and degree distribution. Secondly, we found that subsequent to the consensus formation process, the mean shortest path and clustering coefficient are less affected by both random and targeted node disconnection. Speculation on the relevance of these results to real world applications is provided.     

The origin of preferential attachment and the generalized preferential attachment for weighted networks

In this paper, we first discuss the origin of preferential attachment. Then we establish the generalized preferential attachment (GPA) which has two new properties; first, it encapsulates both the topological and weight aspects of a network, which makes it is neither entirely degree preferential nor entirely weight preferential. Second, it can tell us not only the chance that each already-existing vertex being connected but also how much weight each new edge has. The GPA can generate four power-law distributions, besides the three for vertex degrees, vertex strengths, and edge weights, it yields a new power-law distribution for the subgraph degrees.     

Detecting overlapping communities of weighted networks via a local algorithm

Identification of communities is significant in understanding the structures and functions of networks. Since some nodes naturally belong to several communities, the study of overlapping communities has attracted increasing attention recently, and many algorithms have been designed to detect overlapping communities. In this paper, an overlapping communities detecting algorithm is proposed whose main strategies are finding an initial partial community from a node with maximal node strength and adding tight nodes to expand the partial community. Seven real-world complex networks and one synthetic network are used to evaluate the algorithm. Experimental results demonstrate that the algorithm proposed is efficient for detecting overlapping communities in weighted networks.     

Synchronization of impulsively coupled complex networks

We investigate the synchronization of complex networks,which are impulsively coupled only at discrete instants.Based on the comparison theory of impulsive differential systems,a distributed impulsive control scheme is proposed for complex dynamical networks to achieve synchronization.The proposed scheme not only takes into account the influence of all nodes to network synchronization,which depends on the weight of each node in the network,but also provides us with a flexible method to select the synchronized state of the network.In addition,it is unnecessary for the impulsive coupling matrix to be symmetrical.Finally,the proposed control scheme is applied to a chaotic Lorenz network and Chua’s circuit network.Numerical simulations are used to illustrate the validity of this control scheme.     

Cluster consensus of second-order multi-agent systems via pinning control

This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents.Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle.Finally,some simple simulations are presented to illustrate the technique.     

The effect of weight on community structure of networks

The effect of weight on community structures is investigated in this paper. We use weighted modularity Q^w$Q^w$ to evaluate the partitions and weighted extremal optimization algorithm to detect communities. Starting from empirical and idealized weighted networks, the matching between weights and edges are disturbed. Then using similarity function S to measure the difference between community structures, it is found that the redistribution of weights does strongly affect the community structure especially in dense networks. This indicates that the community structure in networks is a suitable property to reflect the role of weight.     

Symmetry-based structure entropy of complex networks

Precisely quantifying the heterogeneity or disorder of network systems is important and desired in studies of behaviors and functions of network systems. Although various degree-based entropies have been available to measure the heterogeneity of real networks, heterogeneity implicated in the structures of networks can not be precisely quantified yet. Hence, we propose a new structure entropy based on automorphism partition. Analysis of extreme cases shows that entropy based on automorphism partition can quantify the structural heterogeneity of networks more precisely than degree-based entropies. We also summarized symmetry and heterogeneity statistics of many real networks, finding that real networks are more heterogeneous in the view of automorphism partition than what have been depicted under the measurement of degree-based entropies; and that structural heterogeneity is strongly negatively correlated to symmetry of real networks.     

Synchronization of coupled dynamical chaotic networks via scalar controllers

Some scalar linear controllers, which can ensure that the states of coupled chaotic dynamical networks asymptotically synchronize each other, are derived on the basis of high gain state feedback control. Numerical simulation is given to validate the proposed theoretical result.     

Structure identification of an uncertain network coupled with complex-variable chaotic systems via adaptive impulsive control

In this paper, structure identification of an uncertain network coupled with complex-variable chaotic systems is in- vestigated. Both the topological structure and the system parameters can be unknown and need to be identified. Based on impulsive stability theory and the Lyapunov function method, an impulsive control scheme combined with an adaptive strategy is adopted to design effective and universal network estimators. The restriction on the impulsive interval is relaxed by adopting an adaptive strategy. Further, the proposed method can monitor the online switching topology effectively. Several numerical simulations are provided to illustrate the effectiveness of the theoretical results.     

Adaptive coupled synchronization of non-autonomous systems in ring networks

The adaptive coupled synchronization method for non-autonomous systems is proposed. This method can avoid estimating the value of coupling coefficient. Under the uniform Lipschitz assumption, we derive the asymptotical synchronization for a general coupling ring network with N identical non-autonomous systems~ even when N is large enough. Strict theoretical proofs are given. Numerical simulations illustrate the effectiveness of the present method.     

Exponential synchronization of coupled memristive neural networks via pinning control

This paper is concerned with the exponential synchronization problem of coupled memristive neural networks. In contrast to general neural networks, memristive neural networks exhibit state-dependent switching behaviors due to the physical properties of memristors. Under a mild topology condition, it is proved that a small fraction of controlled sub-systems can efficiently synchronize the coupled systems. The pinned subsystems are identified via a search algorithm. Moreover, the information exchange network needs not to be undirected or strongly connected. Finally, two numerical simulations are performed to verify the usefulness and effectiveness of our results.     

基于脉冲耦合神经网络和图像熵的各向异性扩散模型研究

在图像去噪过程中, 大部分基于偏微分方程的各向异性扩散模型均使用梯度信息检测边缘, 当边缘部分被噪声严重污染时, 这些方法不能有效检测出这些边缘, 因而无法保留边缘特征. 为了较完整的保留图像的区域信息, 用脉冲耦合神经网络(PCNN)能使具有相似输入的神经元同时产生脉冲的性质对噪声图像做处理, 得到图像熵序列, 并将图像熵序列作为边缘检测算子引入到扩散方程中, 不仅能克服仅用梯度作为边缘检测算子易受噪声影响的弊端, 而且能较完整地保留图像的区域信息. 然后, 用最小交叉熵准则搜索使去噪前后图像信息量差异最小的阈值, 设计最佳阈值控制扩散强度, 建立基于脉冲耦合神经网络与图像熵改进的各向异性扩散模型(PCNN-IEAD). 分析与仿真结果表明, 该模型与经典模型相比, 保留了更多的图像信息, 能够兼顾去除图像的噪声和保护图像的边缘纹理等细节信息, 较完整的保留了图像的区域信息, 性能指标同样也证实了新模型的优越性. 另外, 该模型的运行时间较经典模型的短, 因此, 该模型是一个理想的模型.