复杂网络可控性研究现状综述

控制复杂系统是人们对复杂系统模型结构及相关动力学进行研究的最终目标, 反映人们对复杂系统的认识能力. 近年来, 通过控制理论和复杂性科学相结合,复杂网络可控性的研究引起了人们的广泛关注. 在过去的几年内, 来自国内外不同领域的研究人员从不同的角度对复杂网络可控性进行了深入的分析研究, 取得了丰硕的成果. 本文重点讨论了复杂网络的结构可控性研究进展, 详细介绍了基于最大匹配方法的复杂网络结构可控性分析框架, 综述了自2011年以来复杂网络可控性的相关研究成果, 具体论述了不同类型的可控性、可控性与网络拓扑结构统计特征的关联、基于可控性的网络及节点度量、控制的鲁棒性和可控性的相关优化方法. 最后, 对网络可控性未来的研究动态进行了展望, 有助于国内同行开展网络可控性的相关研究.     

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

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

Rich-club network topology to minimize synchronization cost due to phase difference among frequency-synchronized oscillators

As exemplified by power grids and large-scale brain networks, some functions of networks consisting of phase oscillators rely on not only frequency synchronization, but also phase synchronization among the oscillators. Nevertheless, even after the oscillators reach frequency-synchronized status, the phase synchronization is not always accomplished because the phase difference among the oscillators is often trapped at non-zero constant values. Such phase difference potentially results in inefficient transfer of power or information among the oscillators, and avoids proper and efficient functioning of the networks. In the present study, we newly define synchronization cost by using the phase difference among the frequency-synchronized oscillators, and investigate the optimal network structure with the minimum synchronization cost through rewiring-based optimization. By using the Kuramoto model, we demonstrate that the cost is minimized in a network with a rich-club topology, which comprises the densely-connected center nodes and low-degree peripheral nodes connecting with the center module. We also show that the network topology is characterized by its bimodal degree distribution, which is quantified by Wolfson’s polarization index.     

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

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

Synchronization-based topology identification of weighted general complex dynamical networks with time-varying coupling delay

Many existing papers investigated the geometric features, control and synchronization of complex dynamical networks provided with certain topology. However, the exact topology of a network is sometimes unknown or uncertain. Based on LaSalle’s invariance principle, we propose an adaptive feedback technique to identify the exact topology of a weighted general complex dynamical network model with time-varying coupling delay. By receiving the network nodes evolution, the topology of such a kind of network with identical or different nodes, or even with varying topology can be monitored. In comparison with previous methods, time delay is taken into account in this simple, analytical and systematic synchronization-based technique. Particularly, the weight configuration matrix is not necessarily symmetric or irreducible, and the inner-coupling matrix need not be symmetric. Illustrative simulations are provided to verify the correctness and effectiveness of the proposed scheme.     

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.     

Experiments on node-to-node pinning control of Chua’s circuits

In this paper, we study the global intermittent pinning controllability of networks of coupled chaotic oscillators. We explore the feasibility of the recently presented node-to-node pinning control strategy through experiments on Chua’s circuits. We focus on the case of two peer-to-peer coupled Chua’s circuits and we build a novel test-bed platform comprised of three inductorless Chua’s oscillators. We investigate the effect of a variety of design parameters on synchronization performance, including the coupling strength between the oscillators, the control gains, and the switching frequency of node-to-node pinning control. Experimental results demonstrate the effectiveness of this novel pinning control strategy in rapidly taming chaotic oscillator dynamics onto desired reference trajectories while minimizing the overall control effort and the number of pinned network sites. From an analytical standpoint, we present sufficient conditions for global node-to-node pinning controllability and we estimate the maximum switching period for network controllability by adapting and integrating available results on Lyapunov stability theory and partial averaging techniques.     

一种基于网络最大可控子图的导航搜索模型

基于网络可控性模型提出了最大可控子图的概念,在此基础上提出了一种基于最大可控子图的导航搜索模型. 模型中基于最大可控子图的加边策略用最小的代价解决了有向网络搜索中存在的粒子因“无路可走”而终止搜索的问题;基于最大可控子图部署导航节点,仅用节点总数2%左右的导航点,就使全网搜索时间接近导航网络的平均最短路径. 通过在ER和SF 网络上的实验表明,全网搜索时间与网络的可控性有关,可控性越好,添加的边数量越少,同时会使网络中导航节点分布越多,越能提高网络的搜索效率. 关键词： 导航搜索 有向网 网络可控性     

Vulnerability of labeled networks

We propose a metric for vulnerability of labeled graphs that has the following two properties: (1) when the labeled graph is considered as an unlabeled one, the metric reduces to the corresponding metric for an unlabeled graph; and (2) the metric has the same value for differently labeled fully connected graphs, reflecting the notion that any arbitrarily labeled fully connected topology is equally vulnerable as any other. A vulnerability analysis of two real-world networks, the power grid of the European Union, and an autonomous system network, has been performed. The networks have been treated as graphs with node labels. The analysis consists of calculating characteristic path lengths between labels of nodes and determining largest connected cluster size under two node and edge attack strategies. Results obtained are more informative of the networks’ vulnerability compared to the case when the networks are modeled with unlabeled graphs.     

Robustness analysis of network controllability

Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure.     

Epidemic dynamics on an adaptive network

Many real-world networks are characterized by adaptive changes in their topology depending on the state of their nodes. Here we study epidemic dynamics on an adaptive network, where the susceptibles are able to avoid contact with the infected by rewiring their network connections. This gives rise to assortative degree correlation, oscillations, hysteresis, and first order transitions. We propose a low-dimensional model to describe the system and present a full local bifurcation analysis. Our results indicate that the interplay between dynamics and topology can have important consequences for the spreading of infectious diseases and related applications.     

Traffic dynamics on layered complex networks

To minimize traffic congestion, understanding how traffic dynamics depend on network structure is necessary. Many real-world complex systems can be described as multilayer structures. In this paper, we introduce the idea of layers to establish a traffic model of two-layer complex networks. By comparing different two-layer complex networks based on random and scale-free networks, we find that the physical layer is much more important to the network capacity of two-layer complex networks than the logical layer. Two-layer complex networks with a homogeneous physical topology are found to be more tolerant to congestion. Moreover, simulation results show that the heterogeneity of logical and physical topologies makes the packet-delivery process of two-layer networks more efficient in the free-flow state, without the occurrence of traffic congestion.     

一种基于势博弈的无线传感器网络拓扑控制算法

在实际的应用中,无线传感器网络常常由大量电池资源有限的传感器节点组成.如何降低网络功耗,最大化网络生存时间,是传感器网络拓扑控制技术的重要研究目标.随着传感节点的运行,节点的能量分布可能越来越不均衡,需要在考虑该因素的情况下,动态地调整节点的网络负载以均衡节点的能耗,达到延长网络生存时间的目的.该文引入博弈理论和势博弈的概念,综合考虑节点的剩余能量和节点发射功率等因素,设计了一种基于势博弈的拓扑控制模型,并证明了该模型纳什均衡的存在性.通过构造兼顾节点连通性和能耗均衡性的收益函数,以确保降低节点功耗的同时维持网络的连通性.通过提高邻居节点的平均剩余能量值以实现将剩余能量多的节点选择作为自身的邻居节点,提高节点能耗的均衡性.在此基础上,提出了一种分布式的能耗均衡拓扑控制算法.理论分析证明了该算法能保持网络的连通性.与现有基于博弈理论的DIA算法和MLPT算法相比,本算法形成的拓扑负载较重、剩余能量较小的瓶颈节点数量较少,节点剩余能量的方差较小,网络生存时间更长.     

A novel method to identify influential nodes based on hybrid topology structure

With the increasing popularity of rail transit and the increasing number of light rail trips, the vulnerability of rail transit has become increasingly prominent. Once the rail transit is maliciously broken or the light rail station is repaired, it may lead to large-scale congestion or even the paralysis of the whole rail transit network. Hence, it is particularly important to identify the influential nodes in the rail transit network. Existing identifying methods considered a single scenario on either betweenness centrality (BC) or closeness centrality. In this paper, we propose a hybrid topology structure (HTS) method to identify the critical nodes based on complex network theory. Our proposed method comprehensively considers the topology of the node itself, the topology of neighbor nodes, and the global influence of the node itself. Finally, the susceptible–infected–recovered (SIR) model, the monotonicity (M), the distinct metric (DM), the Jaccard similarity coefficient (JSC), and the Kendall correlation coefficient (KC) are utilized to evaluate the proposed method over the six real-world networks. Experimental results confirm that the proposed method achieves higher performance than existing methods in identifying networks.     

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.     

Motif structure and cooperation in real-world complex networks

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.     

Communication boundaries in networks

We investigate and quantify the interplay between topology and the ability to send specific signals in complex networks. We find that in a majority of investigated real-world networks the ability to communicate is favored by the network topology at small distances, but disfavored at larger distances. We further suggest how the ability to locate specific nodes can be improved if information associated with the overall traffic in the network is available.     

微博双向“关注”网络节点中心性及传播 影响力的分析

根据新浪微博的实际数据, 建立了两个基于双向“关注”的用户关系网络, 通过分析网络拓扑统计特征, 发现二者均具有小世界、无标度特征. 通过对节点度、紧密度、介数和k-core 四个网络中心性指标进行实证分析, 发现节点度服从分段幂率分布; 介数相比其他中心性指标差异性最为显著; 两个网络均具有明显的层次性, 但不是所有度值大的节点核数也大; 全局范围内各中心性指标之间存在着较强的相关性, 但在度值较大的节点群这种相关性明显减弱. 此外, 借助基于传染病动力学的SIR信息传播模型来分析四种指标在刻画节点传播能力方面的差异性, 仿真结果表明, 选择具有不同中心性指标的初始传播节点, 对信息传播速度和范围均具有不同影响; 紧密度和k-core较其他指标可以更加准确地描述节点在信息传播中所处的网络核心位置, 这有助于识别信息传播拓扑网络中的关键节点.     

Individual’s strategy characterized by local topology conditions in prisoner’s dilemma on scale-free networks

We introduce a “gradient” to find out the defectors, and further a “topology potential” to characterize the individual’s strategy preference in the prisoner’s dilemma on scale-free networks. It is shown that the cooperators typically locate on the nodes with high topology potential and the defectors are mainly found on the nodes with small topology potential. A critical topology potential is found for the nodes where cooperators are nip and tuck with defectors. So the information of node’s degree, gradient and topology potential together can predict individual’s strategy decision in the prisoner’s dilemma on the complex networks.     

Effects of degree correlation on the controllability of networks

In this paper, we investigate the effects of degree correlation on the controllability of undirected networks with different degree-mixing patterns based on simulation analysis. Considering random pinning, max-degree pinning and mix-degree pinning, some relevance factors on controllability such as the control gain and the number of pinned nodes are discussed in detail. It is found that disassortative mixing enhances the network controllability contrast to assortative mixing, to which the network controllability is sensible. Furthermore, too large or too low value of the feedback gain can reduce the controllability. From the viewpoint of practical application, mix-degree pinning strategy is suggested in assortative network, while in disassortative network, max-degree pinning scheme is better than random pinning.