考虑网络流量的无标度网络病毒免疫策略研究

考虑网络交通流量对病毒传播行为的影响,基于平均场理论研究无标度网络上的病毒免疫策略,提出一种改进的熟人免疫机理.理论分析表明,在考虑网络交通流量影响的情况下,当免疫节点密度较小时,随机免疫几乎不能降低病毒的传播速率,而对网络实施目标免疫则能够有效抑制病毒的传播,并且选择度最大的节点进行免疫与选择介数最大的节点进行免疫的效果基本相同.研究还发现,对于网络全局信息未知的情况,与经典熟人免疫策略相比,所提出的免疫策略能够获得更好的免疫效果.通过数值仿真对理论分析进行了验证. 关键词： 无标度网络 病毒传播 交通流量 免疫策略     

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

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

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

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

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

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

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

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

复杂网络的顶点着色及其在疾病免疫中的应用

在复杂网络研究中, 对于网络结构特征的分析已经引起了人们的极大关注, 而其中的网络着色问题却没有得到足够的重视. 为了理解网络结构与着色之间的关系, 本文研究了WS, BA网络以及不同宏观结构参量对于正常K色数的影响, 发现最大团数可以大致反映正常K色数的变化趋势, 而网络的平均度和匹配系数比异质性和聚类系数对于色数的影响更大. 对于一些实际网络的正常着色验证了本文的分析结果. 对复杂网络的顶点进行着色后, 根据独立集内任意两个顶点均不相邻的特点, 我们提出了基于独立集的免疫策略. 与全网随机免疫相比, 基于独立集的免疫策略可令网络更为脆弱, 从而有效抑制疾病的传播. 基于网络着色的独立集提供了一种崭新的免疫思路, 作为一个简单而适用的平台,有助于设计更为有效的免疫策略. 关键词： 复杂网络 正常着色 独立集 免疫策略     

可调聚类系数加权无标度网络建模及其拥塞问题研究

针对实现网络特征的真实情况,提出了一类可调聚类系数的加权无标度网络模型,该模型能够重现现实网络权重和节点度呈幂律分布的统计特性．特别是聚类系数与度之间的非线性关系,恰好符合某些现实网络聚类系数与度之间的平头关系特征．最后研究了可调聚类系数加权网络模型中的拥塞问题．采用基于强度优先传递的局部路由策略,分析了网络中的流量传输问题．     

一种可大范围调节聚类系数的加权无标度网络模型

在Barrat, Barthélemy 和 Vespignani (BBV)加权无标度网络模型的基础上，提出了一种可大范围调节聚类系数的加权无标度网络模型——广义BBV模型(GBBV模型).理论分析和仿真实验表明，GBBV模型保留了BBV模型的许多特征，节点度、节点权重和边权值等都服从幂律分布.但是，GBBV模型克服了BBV模型只能小范围调节聚类系数的缺陷，从而可以用于具有大聚类系数网络的建模. 关键词： 无标度网络 加权网络 聚类系数     

基于一种新型聚类算法的RBF神经网络混沌时间序列预测

运用两阶段学习方法构建径向基函数(RBF)神经网络模型预测混沌时间序列.在利用非监督学习算法确定网络隐层中心时,提出了一种基于高斯基的距离度量,并联合输入输出聚类的策略.基于Fisher可分离率设计高斯基距离度量中的惩罚因子,可以提高聚类的性能.而输入输出聚类策略的引入,建立了聚类性能与网络预测性能之间的联系.因此,根据本文方法构建的网络模型,一方面可以加快网络训练的速度,另一方面可以提高预测性能.将该方法对Mackey-Glass, Lorenz和Logistic混沌时间序列进行了预测仿真研究,仿真结果表明了该方法的有效性. 关键词： 混沌时间序列 预测 径向基神经网络 聚类     

考虑边聚类与扩散特性的信息传播网络结构优化算法

优化网络结构以促进信息在网络中传播一直是复杂网络研究的重点,网络中边的聚类特性和扩散特性对信息传播具有重要作用. K-truss分解算法是一种利用边的聚类特性识别网络关键节点的算法,然而K-truss算法会受到网络中局部聚类结果 (即相互连接的假核结构)的影响,而这些假核结构里的节点对信息扩散能力通常较弱.为此,本文提出一种衡量边扩散特性的指标,研究发现一些位于网络边缘的边具有很好的扩散性,但这类边的聚类很低,并不利于信息传播.通过同时考虑边的聚类特性和扩散特性之间的制约关系,提出一种信息传播网络结构优化算法.为了验证所提算法的有效性,使用该算法对四个真实的网络进行结构优化,并使用经典的独立级联模型来验证网络结构优化前后信息传播的有效范围.结果表明:使用提出的算法优化后的网络拓扑可以有效提高信息传播范围;并且,优化后的网络其叶子节点数目降低、聚类系数降低以及平均路径长度降低.     

推荐重要节点部署防御策略的优化模型

当前网络安全防御策略集中部署于高连接度节点主要有2个方面的不足: 一是高连接度节点在很多场合中并不是网络通信的骨干节点; 二是该类节点对信息的转发和传播并非总是最有效的.针对以上传统部署策略的不足, 改进了恶意病毒程序传播的离散扩散模型并采用中间路径跳数来衡量网络节点的重要程度, 提出了基于介数中心控制力和接近中心控制力模型的重要节点优先推荐部署技术.实验结果显示具有高介数中心控制力和低接近中心控制力的节点相对于传统的高连接度节点无论在无标度网络还是小世界网络均能够对恶意病毒程序的疫情扩散和早期传播速度起到更加有效的抑制作用, 同时验证了网络分簇聚类行为产生的簇团特性也将对恶意程序的传播起到一定的负面影响.     

Networks of interactions in the secondary and tertiary structure of ribosomal RNA

We construct four different structural networks for both the secondary and tertiary structures of the 16S and 23S ribosomal RNAs (rRNAs) in the high-resolution crystal structures of the Thermus thermophilus 30S and Haloarcula marismortui 50S ribosomal subunits, and investigate topological characteristics of the rRNA structures by determining relevant measures, such as the characteristic path length, the clustering coefficient, and the helix betweenness. This study reveals that the 23S rRNA network is more compact than the 16S rRNA networks, reflecting the more globular overall structure of the 23S rRNA relative to the 16S rRNA. In particular, the large number of tertiary interactions in the 23S rRNA tends to cluster, accounting for its small-world network properties. In addition, although the rRNA networks are not the scale-free network, their helix betweenness has a power-law distribution and is correlated with the phylogenetic conservation of helices. The higher the helix betweenness, the more conserved the helix. These results suggest a potential role of the rRNA network as a new quantitative approach in rRNA research.     

基于度与集聚系数的网络节点重要性度量方法研究

网络中节点重要性度量对于研究网络的鲁棒性具有十分重要的意义. 研究者们普遍运用度或集聚系数来度量节点的重要程度, 然而度指标只考虑节点自身邻居个数而忽略了其邻居之间的信息, 集聚系数只考虑节点邻居之间的紧密程度而忽略了其邻居的规模. 本文综合考虑节点的邻居个数, 以及其邻居之间的连接紧密程度, 提出了一种基于邻居信息与集聚系数的节点重要性评价方法. 对美国航空网络和美国西部电力网进行的选择性攻击实验表明, 采用该方法的效果较k-shell指标可以分别提高24%和112%. 本文的节点重要性度量方法只需要考虑网络局部信息, 因此非常适合于对大规模网络的节点重要性进行有效分析. 关键词： 网络科学 鲁棒性 节点重要性 集聚系数     

Exploring evolutionary features of directed weighted hazard network in the subway construction

A better understanding of previous accidents is an effective way to reduce the occurrence of similar accidents in the future. In this paper, a complex network approach is adopted to construct a directed weighted hazard network(DWHN) to analyze topological features and evolution of accidents in the subway construction. The nodes are hazards and accidents, the edges are multiple relationships of these nodes and the weight of edges are occurrence times of repetitive relationships. The results indicate that the DWHN possesses the property of small-world with small average path length and large clustering coefficient, indicating that hazards have better connectivity and will spread widely and quickly in the network. Moreover,the DWHN has the property of scale-free network for the cumulative degree distribution follows a power-law distribution.It makes DWHN more vulnerable to target attacks. Controlling key nodes with higher degree, strength and betweenness centrality will destroy the connectivity of DWHN and mitigate the spreading of accidents in the network. This study is helpful for discovering inner relationships and evolutionary features of hazards and accidents in the subway construction.     

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

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

An improved local immunization strategy for scale-free networks with a high degree of clustering

The design of immunization strategies is an extremely important issue for disease or computer virus control and prevention. In this paper, we propose an improved local immunization strategy based on node’s clustering which was seldom considered in the existing immunization strategies. The main aim of the proposed strategy is to iteratively immunize the node which has a high connectivity and a low clustering coefficient. To validate the effectiveness of our strategy, we compare it with two typical local immunization strategies on both real and artificial networks with a high degree of clustering. Simulations on these networks demonstrate that the performance of our strategy is superior to that of two typical strategies. The proposed strategy can be regarded as a compromise between computational complexity and immune effect, which can be widely applied in scale-free networks of high clustering, such as social network, technological networks and so on. In addition, this study provides useful hints for designing optimal immunization strategy for specific network.     

Do topological parameters of amino acids within protein contact networks depend on their physico-chemical properties?

The three dimensional structure of a protein is determined by the interactions of its constituent amino acids. Considering the amino acids as nodes and the non-bonded interactions among them in 3D space as edges, researchers have constructed protein contact networks and analyzed the values of several topological parameters to uncover different important aspects of proteins. Here, we have analyzed some of the topological parameters such as degree, strength, clustering coefficients, betweenness and closeness centrality of each of the twenty amino acids in a set of non-redundant proteins covering all classes and folds. The results show that the values of these topological parameters vary widely with different amino acids. Also, these values differ significantly with different length scales of proteins. Most of the hydrophobic residues along with Cys, Arg and His have larger contributions to the long range connectivities than short range. We have also studied whether the values of topological parameters have any significant dependency on the physico-chemical properties of the amino acids. While the clustering coefficients show a strong negative correlation with residual volumes, surface areas and number of atoms in the side chains of amino acids; the degrees, strengths and betweenness show positive correlations with the mentioned properties. All the topological parameters show high dependency on bulkiness and average area buried of the amino acid residues in all-range residue networks. The average degree shows higher dependency on hydrophobicity, while the average strength is more able to capture the essences of surface area, residual volume and number of atoms of amino acids. The hydrophobicities of the amino acids and their corresponding degrees show a higher positive correlation in long range networks (LRNs) than short range networks (SRNs). The closeness centrality shows high correlation with two hydrophobic scales and no correlation with surface area, residual volume or number of atoms in LRNs. We have further explored the relationship in hydrophobic, hydrophilic and charged residues separately. Interestingly, charged residues show a higher dependency on the number of atoms than their residual volumes and surface areas. Finally, we present a linear regression model relating the network parameters with physico-chemical properties of amino acids.     

Error and attack tolerance of synchronization in Hindmarsh–Rose neural networks with community structure

Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh–Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.