分布式发电系统感性负载的远程混沌同步

对含有大规模感性负载分布式发电系统（DG）的远程同步进行研究.以风力发电机作为DG发电节点,以永磁同步电机作为实际感性负载,建立一个具有网络耦合作用的DG数学模型,分析不同拓扑网络结构（包括星型、多层网络结构型、随机网络结构型、实际电网IEEE39系统）DG系统感性负载的远程同步特性,进行数值仿真.研究表明：感性负载通过发电机组的中继作用可实现远程混沌同步.研究结果对保证分布式发电系统的同步稳定运行具有意义.     

Return probability for random walks on scale-free complex trees

The time course of random processes usually differs depending on the topology of complex networks which are a substrate for the process. However, as this Letter demonstrates, the first-return as well as the survival probabilities for random walks on the scale-free (SF) trees decay in time according to the same invariant power-law behavior. This means that both quantities are independent of the node power-law degree distributions which are distinguished by different scaling exponents. It is also shown here that the crucial property of the networks, affecting the dynamics of random walks, is their tree-like topology and not SF architecture. All analytical results quantifying these predictions have been verified through extensive computer simulations.     

Amplified signal response in scale-free networks by collaborative signaling

Many natural and artificial two-states signaling devices are connected forming networks. The information-processing potential of these systems is usually related to the response to weak external signals. Here, using a network of overdamped bistable elements, we study the effect of a heterogeneous complex topology on the signal response. The analysis of the problem in random scale-free networks, reveals that heterogeneity plays a crucial role in amplifying external signals. We have contrasted numerical simulations with analytical calculations in simplified topologies.     

具有双峰特性的双层超网络模型

随着社会经济的快速发展,社会成员及群体之间的关系呈现出了更复杂、更多元化的特点.超网络作为一种描述复杂多元关系的网络,已在不同领域中得到了广泛的应用.服从泊松度分布的随机网络是研究复杂网络的开创性模型之一,而在现有的超网络研究中,基于ER随机图的超网络模型尚属空白.本文首先在基于超图的超网络结构中引入ER随机图理论,提出了一种ER随机超网络模型,对超网络中的节点超度分布进行了理论分析,并通过计算机仿真了在不同超边连接概率条件下的节点超度分布情况,结果表明节点超度分布服从泊松分布,符合随机网络特征并且与理论推导相一致.进一步,为更准确有效地描述现实生活中的多层、异质关系,本文构建了节点超度分布具有双峰特性,层间采用随机方式连接,层内分别为ER-ER,BA-BA和BA-ER三种不同类型的双层超网络模型,理论分析得到了三种双层超网络节点超度分布的解析表达式,三种双层超网络在仿真实验中的节点超度分布均具有双峰特性.     

Global synchronization in general complex delayed dynamical networks and its applications

The main objective of the present paper is further to investigate global synchronization of a general model of complex delayed dynamical networks. Based on stability theory on delayed dynamical systems, some simple yet less conservative criteria for both delay-independent and delay-dependent global synchronization of the networks are derived analytically. It is shown that under some conditions, if the uncoupled dynamical node is stable itself, then the network can be globally synchronized for any coupling delays as long as the coupling strength is small enough. On the other hand, if each dynamical node of the network is chaotic, then global synchronization of the networks is heavily dependent on the effects of coupling delays in addition to the connection configuration. Furthermore, the results are applied to some typical small-world (SW) and scale-free (SF) complex networks composing of coupled dynamical nodes such as the cellular neural networks (CNNs) and the chaotic FHN neuron oscillators, and numerical simulations are given to verify and also visualize the theoretical results.     

Critical behavior of blind spots in sensor networks

Blind spots in sensor networks, i.e., individual nodes or small groups of nodes isolated from the rest of the network, are of great concern as they may significantly degrade the network's ability to collect and process information. As the operations of many types of sensors in realistic applications rely on short-lifetime power supplies (e.g., batteries), once they are used up ("off"), replacements become necessary ("on"). This off-and-on process can lead to blind spots. An issue of both theoretical and practical interest concerns the dynamical process and the critical behavior associated with the occurrence of blind spots. In particular, there can be various network topologies, and the off-and-on process can be characterized by the probability that a node functions normally, or the occupying probability of a node in the network. The question to be addressed in this paper concerns how the dynamics of blind spots depend on the network topology and on the occupying probability. For regular, random, and mixed networks, we provide theoretical formulas relating the probability of blind spots to the occupying probability, from which the critical point for the occurrence of blind spots can be determined. For scale-free networks, we present a procedure to estimate the critical point. While our theoretical and numerical analyses are presented in the framework of sensor networks, we expect our results to be generally applicable to network partitioning issues in other networks, such as the wireless cellular network, the Internet, or transportation networks, where the issue of blind spots may be of concern.     

基于传播免疫的复杂网络可控性研究

复杂网络控制反映了人类对复杂系统的认识深度和改造能力. 最新研究成果基于线性系统控制理论建立了复杂网络可控性的理论架构, 能够发现任意拓扑结构的线性时不变复杂网络中控制全部节点状态的最小驱动节点集, 但是该模型未考虑免疫节点或失效节点对控制信号传播的阻断.在继承该模型优点的前提下, 重新构建了基于传播免疫的复杂网络控制模型.在采用分属于随机免疫和目标免疫两种策略的 4个方法确定免疫节点的情况下,分析14个真实网络的可控性.结果表明:如果将网络中度数、 介数和紧密度指标较高的节点作为免疫节点,将极大地提高控制复杂网络的难度. 从而在一定程度上丰富了以往模型的结论.     

Monomer-dimer model on a scale-free small-world network

The explicit determination of the number of monomer-dimer arrangements on a network is a theoretical challenge, and exact solutions to monomer-dimer problem are available only for few limiting graphs with a single monomer on the boundary, e.g., rectangular lattice and quartic lattice; however, analytical research (even numerical result) for monomer-dimer problem on scale-free small-world networks is still missing despite the fact that a vast variety of real systems display simultaneously scale-free and small-world structures. In this paper, we address the monomer-dimer problem defined on a scale-free small-world network and obtain the exact formula for the number of all possible monomer-dimer arrangements on the network, based on which we also determine the asymptotic growth constant of the number of monomer-dimer arrangements in the network. We show that the obtained asymptotic growth constant is much less than its counterparts corresponding to two-dimensional lattice and Sierpinski fractal having the same average degree as the studied network, which indicates from another aspect that scale-free networks have a fundamentally distinct architecture as opposed to regular lattices and fractals without power-law behavior.     

Individual complex Dirac eigenvalue distributions from random matrix theory and comparison to quenched lattice QCD with a quark chemical potential

We analyze how individual eigenvalues of the QCD Dirac operator at nonzero quark chemical potential are distributed in the complex plane. Exact and approximate analytical results for both quenched and unquenched distributions are derived from non-Hermitian random matrix theory. When comparing these to quenched lattice QCD spectra close to the origin, excellent agreement is found for zero and nonzero topology at several values of the quark chemical potential. Our analytical results are also applicable to other physical systems in the same symmetry class.     

一种能耗均衡的无线传感器网络加权无标度拓扑研究

针对无线传感器网络节点能耗不均衡问题,通过对节点生命期建模,得出节点生命期受节点剩余能量和通信距离的影响,进而将两端节点生命期作为构建拓扑时边权重的影响因子,通过边权重控制节点权重,最终得出了一种能耗均衡的无线传感器网络加权无标度拓扑模型,并理论证明了该模型的点权、边权和节点度均服从幂律分布.实验结果表明,该模型具有无标度拓扑的强容错性,并有效的均衡了网络中的节点能耗,延长了网络的生命期.     

Green's function study of a mixed spin-1 and spin-3/2 Heisenberg ferrimagnetic system

The magnetic properties of a mixed spin-1 and spin-3/2 Heisenberg ferrimagnetic system on a square lattice are investigated by using the double-time temperature-dependent Green's function technique. In order to decouple the higher order Green's functions, Anderson and Callen's decoupling and random phase approximations have been used. The nearest- and next-nearest-neighbor interactions and the single-ion anisotropies are considered and their effects on compensation and critical temperature are studied.     

Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks

This paper studies the resiliency of hierarchical networks when subjected to random errors, static attacks, and cascade attacks. The performance is compared with existing Erdös–Rényi (ER) random networks and Barabasi and Albert (BA) scale-free networks using global efficiency as the common performance metric. The results show that critical infrastructures modeled as hierarchical networks are intrinsically efficient and are resilient to random errors, however they are more vulnerable to targeted attacks than scale-free networks. Based on the response dynamics to different attack models, we propose a novel hybrid mitigation strategy that combines discrete levels of critical node reinforcement with additional edge augmentation. The proposed modified topology takes advantage of the high initial efficiency of the hierarchical network while also making it resilient to attacks. Experimental results show that when the level of damage inflicted on a critical node is low, the node reinforcement strategy is more effective, and as the level of damage increases, the additional edge augmentation is highly effective in maintaining the overall network resiliency.     

基于节点负荷失效的网络可控性研究

Liu和Barabasi将现代控制理论应用到线性系统的网络可控性问题上, 提出了最小驱动节点集的计算方法, 解决了复杂网络控制的可计算问题. 针对现实网络中存在的节点因负荷过载而失效的问题, 本文提出了基于节点负荷失效的网络可控性模型. 通过对网络采用介数和Weibull失效模型, 在随机和目标失效机制下进行仿真, 研究结果表明: 维持无标度网络可控性的难度要明显大于随机网络; 在目标节点失效机制下, 即使对网络输入极少的失效信号, 也能极大地破坏网络的可控性; 使高介数节点失效要比使度高节点失效更能破坏网络的可控性, 说明高介数节点在维持网络可控性上发挥着重要作用; 对不同的负荷失效模型, 要合理采取措施, 防止网络发生阶跃性全不可控现象. 关键词： 网络可控性 结构可控性 节点失效     

Change of network load due to node removal

The interplay between topology changes and the redistribution of traffic plays a significant role in many real-world networks. In this paper we study how the load of the remaining network changes when nodes are removed. This removal operation can model attacks and errors in networks, or the planned control of network topology. We consider a scenario similar to the data communication networks, and measure the load of a node by its betweenness centrality. By analysis and simulations, we show that when a single node is removed, the change of the remaining network’s load is positively correlated with the degree of the removed node. In multiple-node removal, by comparing several node removal schemes, we show in detail how significantly different the change of the remaining network’s load will be between starting the removal from small degree/betweenness nodes and from large degree/betweenness nodes. Moreover, when starting the removal from small degree/betweenness nodes, we not only observe that the remaining network’s load decreases, which is consistent with previous studies, but also find that the load of hubs keeps decreasing. These results help us to make a deeper understanding about the dynamics after topology changes, and are useful in planned control of network topology.     

噪声环境下时滞耦合网络的广义投影滞后同步

时滞和噪声在复杂网络中普遍存在,而含有耦合时滞和噪声摄动的耦合网络同步的研究工作却极其稀少. 本文针对噪声环境下具有不同节点动力学、不同拓扑结构及不同节点数目的耦合时滞网络,提出了两个网络之间的广义投影滞后同步. 首先,构建了更加贴近现实的驱动-响应网络同步的理论框架;其次,基于随机时滞微分方程LaSalle不变性原理,严格证明了在合理的控制器作用下,驱动网络和响应网络在几乎必然渐近稳定性意义下能够取得广义投影滞后同步;最后,借助于计算机仿真,通过具体的网络模型验证了理论推理的有效性. 数值模拟结果表明,驱动网络与响应网络不但能够达到广义投影滞后同步,而且同步效果不依赖于耦合时滞和比例因子的选取,同时也揭示了更新增益和耦合时滞对同步收敛速度的显著性影响. 关键词： 复杂网络 广义投影滞后同步 随机噪声 时滞     

Role of fractal dimension in random walks on scale-free networks

Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such networks are ubiquitous in real-life world. In this paper, we study the trapping problem on two families of networks. The first is deterministic, often called (x,y)-flowers; the other is random, which is a combination of (1,3)-flower and (2,4)-flower and thus called hybrid networks. The two network families display rich behavior as observed in various real systems, as well as some unique topological properties not shared by other networks. We derive analytically the average trapping time for random walks on both the (x,y)-flowers and the hybrid networks with an immobile trap positioned at an initial node, i.e., a hub node with the highest degree in the networks. Based on these analytical formulae, we show how the average trapping time scales with the network size. Comparing the obtained results, we further uncover that fractal dimension plays a decisive role in the behavior of average trapping time on fractal scale-free networks, i.e., the average trapping time decreases with an increasing fractal dimension.     

Synchronization in complex clustered networks

Synchronization in complex networks has been an active area of research in recent years. While much effort has been devoted to networks with the small-world and scale-free topology, structurally they are often assumed to have a single, densely connected component. Recently it has also become apparent that many networks in social, biological, and technological systems are clustered, as characterized by a number (or a hierarchy) of sparsely linked clusters, each with dense and complex internal connections. Synchronization is fundamental to the dynamics and functions of complex clustered networks, but this problem has just begun to be addressed. This paper reviews some progress in this direction by focusing on the interplay between the clustered topology and network synchronizability. In particular, there are two parameters characterizing a clustered network: the intra-cluster and the inter-cluster link density. Our goal is to clarify the roles of these parameters in shaping network synchronizability. By using theoretical analysis and direct numerical simulations of oscillator networks, it is demonstrated that clustered networks with random inter-cluster links are more synchronizable, and synchronization can be optimized when inter-cluster and intra-cluster links match. The latter result has one counterintuitive implication: more links, if placed improperly, can actually lead to destruction of synchronization, even though such links tend to decrease the average network distance. It is hoped that this review will help attract attention to the fundamental problem of clustered structures/synchronization in network science.      

Heat transport in low-dimensional systems

Recent results on theoretical studies of heat conduction in low-dimensional systems are presented. These studies are on simple, yet non-trivial, models. Most of these are classical systems, but some quantum-mechanical work is also reported. Much of the work has been on lattice models corresponding to phononic systems, and some on hard-particle and hard-disc systems. A recently developed approach, using generalized Langevin equations and phonon Green's functions, is explained and several applications to harmonic systems are given. For interacting systems, various analytic approaches based on the Green–Kubo formula are described, and their predictions are compared with the latest results from simulation. These results indicate that for momentum-conserving systems, transport is anomalous in one and two dimensions, and the thermal conductivity κ diverges with system size L as κ ～ L ^α. For one-dimensional interacting systems there is strong numerical evidence for a universal exponent α = 1/3, but there is no exact proof for this so far. A brief discussion of some of the experiments on heat conduction in nanowires and nanotubes is also given.     

一种基于文本互信息的金融复杂网络模型

复杂网络能够解决许多金融问题,能够发现金融市场的拓扑结构特征,反映不同金融主体之间的相互依赖关系.相关性度量在金融复杂网络构建中至关重要.通过将多元金融时间序列符号化,借鉴文本特征提取以及信息论的方法,定义了一种基于文本互信息的相关系数.为检验方法的有效性,分别构建了基于不同相关系数(Pearson和文本互信息)和不同网络缩减方法(阈值和最小生成树)的4个金融复杂网络模型.在阈值网络中提出了使用分位数来确定阈值的方法,将相关系数6等分,取第4部分的中点作为阈值,此时基于Pearson和文本互信息的阈值模型将会有相近的边数,有利于这两种模型的对比.数据使用了沪深两地证券市场地区指数收盘价,时间从2006年1月4日至2016年12月30日,共计2673个交易日.从网络节点相关性看,基于文本互信息的方法能够体现出大约20%的非线性相关关系;在网络整体拓扑指标上,本文计算了4种指标,结果显示能够使所保留的节点联系更为紧密,有效提高保留节点的重要性以及挖掘出更好的社区结构;最后,计算了阈值网络的动态指标,将数据按年分别构建网络,缩减方法只用了阈值方法,结果显示本文提出的方法在小世界动态和网络度中心性等指标上能够成功捕捉到样本区间内存在的两次异常波动.此外,本文构建的地区金融网络具有服从幂律分布、动态稳定性、一些经济欠发达地区在金融地区网络中占据重要地位等特性.     

Markov chains theory for scale-free networks

This paper proposes a Markov chain method to predict the growth dynamics of the individual nodes in scale-free networks, and uses this to calculate numerically the degree distribution. We first find that the degree evolution of a node in the BA model is a nonhomogeneous Markov chain. An efficient algorithm to calculate the degree distribution is developed by the theory of Markov chains. The numerical results for the BA model are consistent with those of the analytical approach. A directed network with the logarithmic growth is introduced. The algorithm is applied to calculate the degree distribution for the model. The numerical results show that the system self-organizes into a scale-free network.