Enhancing synchronizability by rewiring networks

<正>According to different forms of synchronized region,complex networks are divided into typeⅠ(unbounded synchronization region) and typeⅡ(bounded synchronization region) networks.This paper presents a rewiring algorithm to enhance the synchronizability of typeⅠand typeⅡnetworks.By utilizing the algorithm for an unweighted and undirected network,a better synchronizability of network with the same number of nodes and edges can be obtained. Numerical simulations on several different network models are used to support the proposed procedure.The relationship between different topological properties of the networks and the number of rewirings are shown.It finds that the final optimized network is independent of the initial network,and becomes homogeneous.In addition the optimized networks have similar structural properties in the sense of degree,and node and edge betweenness centralities.However,they do not have similar cluster coefficients for typeⅡnetworks.The research may be useful for designing more synchronizable networks and understanding the synchronization behaviour of networks.     

叶子节点对于网络同步能力影响的研究

系统考察了叶子节点对于网络同步能力的影响,发现随着叶子节点比例的增加,网络的同步能力下降,同时给出了数值结果以及理论解释. 关键词： 复杂网络 叶子节点 同步能力     

复杂网络病毒传播的局域控制研究

从复杂网络的节点路径长度范围的角度来研究病毒传播的局域控制，分析了在不同拓扑结构的复杂网络中进行局域控制的有效性.研究表明，局域控制对WS小世界网络、BA无标度网络和ER随机网络三类复杂网络均有效，但只有WS小世界网络存在零感染的控制范围最优值d=3；对于长程连边的分布存在距离偏好的Kleinberg小世界网络，随着依赖度的增大，病毒传播率临界值增加，同时局域范围控制的效果得到加强. 关键词： 复杂网络 病毒传播 局域控制 路径长度     

Empirical topological investigation of practical supply chains based on complex networks

The industrial supply chain networks basically capture the circulation of social resource, dominating the stability and efficiency of the industrial system. In this paper, we provide an empirical study of the topology of smartphone supply chain network. The supply chain network is constructed using open online data. Our experimental results show that the smartphone supply chain network has small-world feature with scale-free degree distribution, in which a few high degree nodes play a key role in the function and can effectively reduce the communication cost. We also detect the community structure to find the basic functional unit. It shows that information communication between nodes is crucial to improve the resource utilization. We should pay attention to the global resource configuration for such electronic production management.     

基于负荷局域择优重新分配原则的复杂网络上的相继故障

相继故障普遍存在现实的网络系统中,为了更好地探讨复杂网络抵制相继故障的全局鲁棒性,采用网络中节点j上的初始负荷为L_j=k^α_j（k_j为节点j的度）的形式,并基于崩溃节点上负荷的局域择优重新分配的原则,提出了一个新的相继故障模型.依据新的度量网络鲁棒性的指标,探讨了4种典型复杂网络上的相继故障现象.数值模拟表明, 关键词： 相继故障 复杂网络 关键阈值 相变     

复杂网络牵制控制优化选点算法及节点组重要性排序

本文研究复杂网络动力学模型的无向网络牵制控制的优化选点及节点组重要性排序问题.根据牵制控制的同步准则,网络的牵制控制同步取决于网络的Laplacian删后矩阵的最小特征值.因此,通过合理选择受控节点集得到一个较大的Laplacian删后矩阵最小特征值,是牵制控制优化选点问题的核心所在.基于Laplacian删后矩阵最小...     

基于遗传算法的重复囚徒困境博弈策略在复杂网络中的演化

利用遗传算法研究重复囚徒困境博弈策略在复杂网络中的演化.研究结果表明：处于复杂网络中有记忆的个体通过基因的复制、重组、变异和选择能够进化出一种自组织的合作机制.这种合作机制既能够在群体中激发合作行为的产生，加强和维护持续的合作行为，同时又能对背叛的个体进行惩罚和报复，因此能够促使复杂网络中进化出具有很高合作率的群体. 关键词： 复杂网络 遗传算法 进化博弈 合作     

Impact of delays and rewiring on the dynamics of small-world neuronal networks with two types of coupling

We study synchronization transitions and pattern formation on small-world networks consisting of Morris-Lecar excitable neurons in dependence on the information transmission delay and the rewiring probability. In addition, networks formed via gap junctional connections and coupling via chemical synapses are considered separately. For gap-junctionally coupled networks we show that short delays can induce zigzag fronts of excitations, whereas long delays can further detriment synchronization due to a dynamic clustering anti-phase synchronization transition. For the synaptically coupled networks, on the other hand, we find that the clustering anti-phase synchronization can appear as a direct consequence of the prolongation of information transmission delay, without being accompanied by zigzag excitatory fronts. Irrespective of the coupling type, however, we show that an appropriate small-world topology can always restore synchronized activity if only the information transmission delays are short or moderate at most. Long information transmission delays always evoke anti-phase synchronization and clustering, in which case the fine-tuning of the network topology fails to restore the synchronization of neuronal activity.     

基于可调负载重分配的无标度网络连锁效应分析

为了深入研究复杂网络抵制连锁故障的全局鲁棒性,针对现实网络上的负载重分配规则常常是介于全局分配与最近邻分配、均匀分配与非均匀分配的特点,围绕负荷这一影响连锁故障发生和传播最重要的物理量以及节点崩溃后的动力学过程,提出了一种可调负载重分配范围与负载重分配异质性的复杂网络连锁故障模型,并分析了该模型在无标度网络上的连锁故障条件.数值模拟获得了复杂网络抵制连锁故障的鲁棒性与模型中参数的关系.此外,基于网络负载分配规则的分析以及理论解析的推导,验证了数值模拟结论,也证明在最近邻与全局分配两种规则下都存在负载分配均匀性参数等于初始负荷强度参数即β=τ使得网络抵御连锁故障的能力最强.     

一种无线传感器网络簇间拓扑演化模型及其免疫研究

基于复杂网络理论, 研究由于节点失效所导致的无线传感器网络性能下降的问题, 提出一种新的簇间拓扑演化模型, 在此基础上讨论病毒的免疫策略, 并给出一种新的免疫机理. 理论分析表明, 该模型演化生成的网络不仅具有较强的容错性, 而且还可以有效避免节点因能量很快耗尽而过早死亡. 研究还发现, 对于网络全局信息未知的情况, 与随机免疫和熟人免疫策略相比, 本文所提免疫策略能够获得较好的免疫效果. 通过数值仿真对理论分析进行验证.     

Stabilization of a class of dynamical complex networks based on decentralized control

This paper deals with a stabilization problem for a class of dynamical complex networks with each node being a general Lur’e system. Based on a Lur’e-Postnikov function and a special decentralized control strategy, the problem of designing a linear feedback controller such that states of all nodes are globally stabilized onto an expected homogeneous state is addressed. A controller design method based on parameter-dependent Lur’e-Postnikov function is proposed in order to reduce the conservativeness and the controller can be constructed via feasible solutions of a certain set of linear matrix inequalities (LMIs). A dynamical network composed of identical Chua's circuits is adopted as a numerical example to demonstrate the effectiveness of the proposed results.     

基于相继故障信息的网络节点重要度演化机理分析

分析了过载机制下节点重要度的演化机理.首先,在可调负载重分配级联失效模型基础上,根据节点失效后其分配范围内节点的负载振荡程度,提出了考虑级联失效局域信息的复杂网络节点重要度指标.该指标具有两个特点:一是值的大小可以清晰地指出节点的失效后果;二是可以依据网络负载分配范围、负载分配均匀性、节点容量系数及网络结构特征分析节点重要度的演化情况.然后,给出该指标的仿真算法,并推导了最近邻择优分配和全局择优分配规则下随机网络和无标度网络节点重要度的解析表达式.最后,实验验证了该指标的有效性和可行性,并深入分析了网络中节点重要度的演化机理,即非关键节点如何演化成影响网络级联失效行为的关键节点.     

Analyzing the causation of a railway accident based on a complex network

In this paper, a new model is constructed for the causation analysis of railway accident based on the complex network theory. In the model, the nodes are defined as various manifest or latent accident causal factors. By employing the complex network theory, especially its statistical indicators, the railway accident as well as its key causations can be analyzed from the overall perspective. As a case, the ＂7.23＂ China-Yongwen railway accident is illustrated based on this model. The results show that the inspection of signals and the checking of line conditions before trains run played an important role in this railway accident. In conclusion, the constructed model gives a theoretical clue for railway accident prediction and, hence, greatly reduces the occurrence of railway accidents.     

Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding

Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks, solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.     

A preliminary investigation on the topology of Chinese and climate networks

Complex networks have been studied across many fields of science in recent years. In this paper, we give a brief introduction of networks, then follow the original works by Tsonis et al (2004, 2006) starting with data of the surface temperature from 160 Chinese weather observations to investigate the topology of Chinese climate networks. Results show that the Chinese climate network exhibits a characteristic of regular, almost fully connected networks, which means that most nodes in this case have the same number of links, and so-called super nodes with a very large number of links do not exist there. In other words, though former results show that nodes in the extratropical region provide a property of scale-free networks, they still have other different local fine structures inside. We also detect the community of the Chinese climate network by using a Bayesian technique; the effective number of communities of the Chinese climate network is about four in this network. More importantly, this technique approaches results in divisions which have connections with physics and dynamics; the division into communities may highlight the aspects of the dynamics of climate variability.     

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.     

An analysis of the radial flow in the heterogeneous porous media based on fractal and constructal tree networks

In this paper, an analysis of the radial flow in the heterogeneous porous media based on fractal and constructal tree networks is presented. A dual-domain model is applied to simulate the heterogeneous porous media embedded with a constructal tree network based on the fractal distribution of pore space and tortuosity nature of flow paths. The analytical expressions for seepage velocity, pressure drop, local and global permeability of the network and binary system are derived, and the transport properties for the optimal branching structure are discussed. Notable is that the global permeability (K_n) of the network and the volume fraction (f_n) occupied by the network exhibit linear scaling law with the fractal dimension (D_p) of channel diameter bylogK_n∼0.46D_p and logf_n∼1.03D_p, respectively. Our analytical results are in good agreement with the available numerical results for steady-state soil vapor extraction and indicate that the fractal dimension for pore space has significant effect on the permeable properties of the media. The proposed dual-domain model may capture the characteristics of heterogeneous porous media and help understanding the transport mechanisms of the radial flow in the media.     

Stochastic asymptotical synchronization of chaotic Markovian jumping fuzzy cellular neural networks with mixed delays and the Wiener process based on sampled-data control

We investigate the stochastic asymptotical synchronization of chaotic Markovian jumping fuzzy cellular neural networks (MJFCNNs) with discrete, unbounded distributed delays, and the Wiener process based on sampled-data control using the linear matrix inequality (LMI) approach. The Lyapunov-Krasovskii functional combined with the input delay approach as well as the free-weighting matrix approach is employed to derive several sufficient criteria in terms of LMIs to ensure that the delayed MJFCNNs with the Wiener process is stochastic asymptotical synchronous. Restrictions (e.g., time derivative is smaller than one) are removed to obtain a proposed sampled-data controller. Finally, a numerical example is provided to demonstrate the reliability of the derived results.     

Ranking the spreading influence of nodes in complex networks: An extended weighted degree centrality based on a remaining minimum degree decomposition

Ranking the spreading influence of nodes is crucial for developing strategies to control the spreading process on complex networks. In this letter, we define, for the first time, a remaining minimum degree (RMD) decomposition by removing the node(s) with the minimum degree iteratively. Based on the RMD decomposition, a weighted degree (WD) is presented by utilizing the RMD indices of the nearest neighbors of a node. WD assigns a weight to each degree of this node, which can distinguish the contribution of each degree to the spreading influence. Further, an extended weighted degree (EWD) centrality is proposed by extending the WD of the nearest neighbors of a node. Assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive experiments on a series of synthetic and real networks to comprehensively evaluate the performance of EWD and other eleven representative measures. The experimental results show that EWD is a relatively efficient measure in running efficiency, it exposes an advantage in accuracy in the networks with a relatively small degree heterogeneity, as well as exposes a competitive performance in resolution.     

Fast prediction of aerodynamic noise induced by the flow around a cylinder based on deep neural network

Accurate and fast prediction of aerodynamic noise has always been a research hotspot in fluid mechanics and aeroacoustics. The conventional prediction methods based on numerical simulation often demand huge computational resources, which are difficult to balance between accuracy and efficiency. Here, we present a data-driven deep neural network (DNN) method to realize fast aerodynamic noise prediction while maintaining accuracy. The proposed deep learning method can predict the spatial distributions of aerodynamic noise information under different working conditions. Based on the large eddy simulation turbulence model and the Ffowcs Williams-Hawkings acoustic analogy theory, a dataset composed of 1216 samples is established. With reference to the deep learning method, a DNN framework is proposed to map the relationship between spatial coordinates, inlet velocity and overall sound pressure level. The root-mean-square-errors of prediction are below 0.82 dB in the test dataset, and the directivity of aerodynamic noise predicted by the DNN framework are basically consistent with the numerical simulation. This work paves a novel way for fast prediction of aerodynamic noise with high accuracy and has application potential in acoustic field prediction.