利用邻域“结构洞”寻找社会网络中最具影响力节点

识别复杂网络中的关键节点对网络结构优化和鲁棒性增强具有十分重要的意义. 经典的关键节点测量方法在一定程度上能够辨识网络中影响力节点, 但存在一定局限性: 局部中心性测量方法仅考虑节点邻居的数目, 忽略了邻居间的拓扑关系, 不能在计算中反映邻居节点间的相互作用; 全局测量方法则由于算法本身的复杂性而不能应用于大规模社会网络的分析, 另外, 经典的关键节点测量方法也没有考虑社会网络特有的社区特征. 为高效、准确地辨识具有社区结构的社会网络中最具影响力节点, 提出了一种基于节点及其邻域结构洞的局部中心性测量方法, 该方法综合考虑了节点的邻居数量及其与邻居间的拓扑结构, 在节点约束系数的计算中同时体现了节点的度属性和“桥接”属性. 利用SIR(易感-感染-免疫)模型在真实社会网络数据上对节点传播能力进行评价后发现, 所提方法可以准确地评价节点的传播能力且具有强的鲁棒性.     

一种适用换热网络同步综合的改进混沌蚁群算法

提出一种适用于换热网络同步综合的改进混沌蚁群算法.在标准算法的基础上引入组织变量更新策略、新型动态邻域拓扑结构,增强算法的全局搜索能力和局部搜索能力.提出两条整型变量优化策略使算法具备优化整型变量的能力和特性.选取两个不同规模的换热网络问题对算法进行测试,其鲁棒性和有效性得到验证.     

非一致通信时滞动力学网络上的接连滞后同步

在动力学网络中,节点与节点之间的通信通常存在时滞,并且不同节点之间的通信时滞往往是不同的(即非一致通信时滞),研究非一致通信时滞动力学网络上的接连滞后同步,更具现实意义.为此,本文首先构建含有非一致通信时滞的动力学网络模型.其次分别设计线性反馈控制和自适应反馈控制,利用Lyapunov函数方法,重点分析了该网络的接连滞后同步的稳定性,得到了同步稳定的充分条件.最后,选取蔡氏电路作为局部动力学,又分别选取了链式网络和星型网络这两种拓扑结构来验证理论结果的正确性和有效性.     

确定度分布条件下可变同配系数的算法构造与影响分析

复杂网络是现实中大量节点和边的抽象拓扑, 如何揭示网络内部拓扑对网络连通性、脆弱性等特征的影响是当前研究的热点. 本文在确定度分布的条件下, 根据Newman提出的同配系数的定义分析其影响因素. 首先在可变同配系数下分别提出了基于度分布的确定算法和基于概率分布的不确定算法, 并分别在三种不同类型的网络(Erdös-Rényi网络, Barabási-Albert网络, Email真实网络)中验证. 实验结果表明: 当网络规模达到一定程度时, 确定算法优于贪婪算法. 以此为基础, 分析了同配系数改变时聚类系数的变化, 发现两者之间存在关联性, 并从网络的微观结构变化中揭示了聚类系数变化的原因.     

反射内存网络集线器设计与研究

现有的星型反射内存网络集线器仍以高速数据选择器为核心器件构建,其实质还是将相连的节点组成环形拓扑结构的反射内存网络,并不是真正意义上的星型拓扑结构。针对这一问题,本文设计并实现了一种真正意义上的星型拓扑结构的反射内存网络集线器,并能够通过百兆以太网进行配置与实时监视数据传输过程中的性能指标。该集线器采用了FPGA配合8路高速串并/并串转换芯片的架构,实现了与集线器相连节点的星型拓扑结构,具有很好的并行处理能力,提高了网络数据映射速率。最后,通过实验验证了该集线器的稳定性、实时性与可靠性。     

基于领域相似度的复杂网络节点重要度评估算法

节点重要性度量对于研究复杂网络鲁棒性与脆弱性具有重要意义.大规模实际复杂网络的结构往往随着时间不断变化,在获取网络全局信息用于评估节点重要性方面具有局限性.通过量化节点局部网络拓扑的重合程度来定义节点间的相似性,提出了一种考虑节点度以及邻居节点拓扑重合度的节点重要性评估算法,算法只需要获取节点两跳内的邻居节点信息,通过计算邻居节点对之间的相似度,便可表征其在复杂网络中的结构重要性.基于六个经典的实际网络和一个人工的小世界网络,分别以静态与动态的方式对网络进行攻击,通过对极大连通系数与网络效率两种评估指标的实验结果对比,证明了所提算法优于基于局域信息的度指标、半局部度指标、基于节点度及其邻居度的WL指标以及基于节点位置的K-shell指标.     

超网络中标度律的涌现

本文构建超网络和复杂网络中统一演化模型,研究超网络无标度特性演化机理和拓扑性质.利用Poisson过程理论和连续化方法对模型进行分析,获得网络稳态平均超度分布的解析表达式.仿真实验和理论分析相符合.结果表明:随着网络规模的增大,这个动态演化网络的超度分布遵循无标度的特性.它不仅将每次增加一个新节点与若干个老节点围成一条超边的超网络模型和每次增加若干个新节点与一个老节点围成一条超边的超网络模型统一在一个模型中,而且将复杂网络中著名的无标度模型也作为我们模型的特例.     

面向结构洞的复杂网络关键节点排序

复杂网络中的结构洞节点对于信息传播具有重要作用, 现有关键节点排序方法多数没有兼顾结构洞节点和其他类型的关键节点进行排序. 本文根据结构洞理论与关键节点排序相关研究选取了网络约束系数、介数中心性、等级度、效率、网络规模、PageRank值以及聚类系数7个度量指标, 将基于ListNet的排序学习方法引入到复杂网络的关键节点排序问题中, 融合7个度量指标, 构建了一个能够综合评价面向结构洞节点的关键节点排序方法. 采用模拟网络和实际复杂网络进行了大量实验, 人工标准试验结果表明本文排序方法能够综合考虑结构洞节点和核心节点, 关键节点排序与人工排序结果具有较高的一致性. SIR传播模型评估实验结果表明由本文选择TOP-K节点发起的传播能够在较短的传播时间内达到最大的传播范围.     

虚拟社区网络的演化过程研究

模拟了虚拟社区网络的演化过程并研究其拓扑结构.发现虚拟社区网络在演化过程中,节点的加入、边的加入、网络中度分布、节点的度与其加入网络时间的关系、平均度随时间的变化等方面与传统的无标度网络有所不符.根据国内某论坛的实际网络数据统计与分析,提出了虚拟社区网络的演化机理——虚拟社区网络构造算法.仿真结果表明,模拟以互联网论坛为代表的虚拟社区网络时,该模型能够得到与真实网络相符的特性. 关键词： 复杂网络 虚拟社区 无标度网络     

关联复杂网络建模及辨识研究

运用异质耦合拆分方法和驱动-响应模型,提出关联复杂网络节点参数和拓扑结构的辨识方法.首先,研究异质关联复杂网络建模方法,进而依据网络耦合性质不同,拆分构造了两类异质关联复杂网络.然后运用驱动-响应模型、LaSalle不变原理和Gram矩阵,设计节点系统参数和拓扑参数的自适应辨识观测器.所提的观测器能在线获取网络的节点参数、不同耦合性质的拓扑参数.最后,通过数值仿真验证所提方法的有效性.     

IKN-CF: An Approach to Identify Key Nodes in Inter-Domain Routing Systems Based on Cascading Failures

Inter-domain routing systems is an important complex network in the Internet. Research on the vulnerability of inter-domain routing network nodes is of great support to the stable operation of the Internet. For the problem of node vulnerability, we proposed a method for identifying key nodes in inter-domain routing systems based on cascading failures (IKN-CF). Firstly, we analyzed the topology of inter-domain routing network and proposed an optimal valid path discovery algorithm considering business relationships. Then, the reason and propagation mechanism of cascading failure in the inter-domain routing network were analyzed, and we proposed two cascading indicators, which can approximate the impact of node failure on the network. After that, we established a key node identification model based on improved entropy weight TOPSIS (EWT), and the key node sequence in the network can be obtained through EWT calculation. We compared the existing three methods in two real inter-domain routing networks. The results indicate that the ranking results of IKN-CF are high accuracy, strong stability, and wide applicability. The accuracy of the top 100 nodes of the ranking result can reach 83.6%, which is at least 12.8% higher than the average accuracy of the existing three methods.     

有限步传播范围期望指标判别节点传播影响力

在线社交网络逐渐成为人们不可或缺的重要工具,识别网络中具有高影响力的节点作为初始传播源,在社会感知与谣言控制等方面具有重要意义.本文基于独立级联模型,给出了一个描述有限步传播范围期望的指标-传播度,并设计了一种高效的递推算法.该指标在局部拓扑结构信息的基础上融合了传播概率对影响力进行刻画,能够较好地反映单个节点的传播影响力.对于多传播源影响力极大化问题,本文提出了一种基于传播度的启发式算法-传播度折扣算法,使得多个传播源的联合影响力最大.最后,将上述方法应用到三个真实网络中,与经典指标和方法相比,该方法不需要知道网络的全局结构信息,而是充分了利用网络的局部结构信息,可以较快地筛选出高传播影响力的传播源.     

A decentralised topology control to regulate global properties of complex networks

In the last decade much research effort has been devoted to the investigation of the interplay between properties (i.e. synchronization, clustering, resilience to node fault) and topology of complex networks. Many algorithms have been proposed to construct a network topology with a given properties or to optimize them. These algorithms are static, off-line implemented and may require global network knowledge. In this paper we propose a simple decentralized topology control algorithm that by local actions carried out at the node allows to regulate network global properties. Additionally the algorithm is dynamic coping with both node and link faults and can be on-line implemented.     

Optimal structure of complex networks for minimizing traffic congestion

To design complex networks to minimize traffic congestion, it is necessary to understand how traffic flow depends on network structure. We study data packet flow on complex networks, where the packet delivery capacity of each node is not fixed. The optimal configuration of capacities to minimize traffic congestion is derived and the critical packet generating rate is determined, below which the network is at a free flow state but above which congestion occurs. Our analysis reveals a direct relation between network topology and traffic flow. Optimal network structure, free of traffic congestion, should have two features: uniform distribution of load over all nodes and small network diameter. This finding is confirmed by numerical simulations. Our analysis also makes it possible to theoretically compare the congestion conditions for different types of complex networks. In particular, we find that network with low critical generating rate is more susceptible to congestion. The comparison has been made on the following complex-network topologies: random, scale-free, and regular.     

网络集聚性对节点中心性指标的准确性影响

节点中心性指标是从特定角度对网络某一方面的结构特点进行刻画的度量指标, 因此网络拓扑结构的改变会对节点中心性指标的准确性产生重要影响. 本文利用Holme-Kim模型构建可变集聚系数的无标度网络, 然后采用Susceptible-Infective-Removal模型进行传播影响力的仿真实验, 接着分析了节点中心性指标在不同集聚系数的无标度网络中的准确性. 结果表明, 度中心性和介数中心性的准确性在低集聚系数的网络中表现更好, 特征向量中心性则在高集聚类网络中更准确, 而紧密度中心性的准确性受网络集聚系数的变化影响较小. 因此当网络的集聚系数较低时, 可选择度或者介数作为中心性指标进行网络节点影响力评价; 反之则选择紧密度指标或特征向量指标较好, 尤其当网络的集聚系数接近0.6时特征向量的准确性可以高达到0.85, 是度量小规模网络的较优选择. 另一方面, 传播过程的感染率越高, 度指标和介数指标越可靠, 紧密度和特征向量则相反. 最后Autonomous System实证网络的断边重连实验, 进一步验证了网络集聚性的改变会对节点中心性指标的准确性产生重要影响.     

Synchronization of networks

We study the synchronization of coupled dynamical systems on networks. The dynamics is governed by a local nonlinear oscillator for each node of the network and interactions connecting different nodes via the links of the network. We consider existence and stability conditions for both single- and multi-cluster synchronization. For networks with time-varying topology we compare the synchronization properties of these networks with the corresponding time-average network. We find that if the different coupling matrices corresponding to the time-varying networks commute with each other then the stability of the synchronized state for both the time-varying and the time-average topologies are approximately the same. On the other hand, for non-commuting coupling matrices the stability of the synchronized state for the time-varying topology is in general better than the time-average topology.      

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.     

一种无线传感器网络健壮性可调的能量均衡拓扑控制算法

无线传感器网络中, 应用环境的干扰导致节点间距不能被准确度量. 所以利用以节点间距作为权重的闭包图(EG)模型构建的拓扑没有考虑环境的干扰, 忽略了这部分干扰带来的能耗, 缩短了网络生存时间. 针对无线传感器网络拓扑能量不均的特点和EG模型的缺陷, 首先引入节点度调节因子, 建立通信度量模型和节点实际生存时间模型; 其次量化网络节点度, 从而获取满足能量均衡和网络生命期最大化需求的节点度的取值规律; 然后利用该取值规律和函数极值充分条件解析推导出网络最大能量消耗值和最长生存时间, 并获得最优节点度; 最后基于以上模型提出一种健壮性可调的能量均衡拓扑控制算法. 理论证明该拓扑连通且为双向连通. 仿真结果说明网络能利用最优节点度达到较高的健壮性, 保证信息可靠传输, 且算法能有效平衡节点能耗, 提高网络健壮性, 延长网络生命周期.     

Stimulus-induced transition of clustering firings in neuronal networks with information transmission delay

We propose a conceptually novel method of reconstructing the topology of dynamical networks. By examining the correlation between the variable of one node and the derivative of another node’s variable, we derive a simple matrix equation yielding the network adjacency matrix. Our assumptions are the possession of time series describing the network dynamics, and the precise knowledge of the internal interaction functions. Our method involves a tunable parameter, allowing for the reconstruction precision to be optimized within the constraints of given dynamical data. The method is illustrated on a simple example, and the dependence of the reconstruction precision on the dynamical properties of time series is discussed. Our theory is in principle applicable to any weighted or directed network whose interaction functions are known.     

Detecting overlapping communities by seed community in weighted complex networks

Detection of community structures in the weighted complex networks is significant to understand the network structures and analysis of the network properties. We present a unique algorithm to detect overlapping communities in the weighted complex networks with considerable accuracy. For a given weighted network, all the seed communities are first extracted. Then to each seed community, more community members are absorbed using the absorbing degree function. In addition, our algorithm successfully finds common nodes between communities. The experiments using some real-world networks show that the performance of our algorithm is satisfactory.