具有非均匀传输和抗攻击差异的网络病毒传播模型

针对实际网络中节点存在抗攻击差异以及边的非均匀传输等情况,基于平均场理论,提出具有抗攻击差异和非均匀传输特性的网络病毒传播平均场SIR模型.该模型中,通过引入脆弱性函数和传输函数,分别描述节点的抗攻击差异以及边的非均匀传输能力.通过对所提模型的分析,得到传播阈值的理论结果.理论分析和仿真表明,节点的抗攻击差异以及边的非均匀传输,都可导致出现正的传播阈值,使得病毒传播风险有效降低.     

基于一维元胞自动机的复杂网络恶意软件传播研究

基于一维元胞自动机,研究复杂网络恶意软件传播行为.利用信息网络节点全局交互的特点,建立元胞自动机邻域和状态转换函数,提出恶意软件传播模型,研究在多种网络拓扑下恶意软件传播的概率行为.研究表明,该模型能够准确描述在最近邻耦合网络（nearest-neighbor coupled network, NC）,Erdos-Renyi（ER）随机网络,Watts-Strogatz（WS） 小世界网络和Barabasi-Albert（BA）幂率网络等拓扑下的传播动力学行为,不仅能反映恶意软件传播的平均趋势,而且可以描述病毒消亡和渗透等稀有概率事件,有效克服基于平均场方法建立的微分方程模型只能反映传播的平均趋势,只适合对传播作整体预测的局限性.同时,研究指出网络中度分布的异质化程度和网络的局域空间交互特征是影响传播及免疫行为的关键要素. 关键词： 复杂网络 恶意软件传播 元胞自动机 状态转换函数     

花簇分形无标度网络中节点影响力的区分度

大量研究表明分形尺度特性广泛存在于真实复杂系统中, 且分形结构显著影响网络上的传播动力学行为. 虽然复杂网络的节点传播影响力吸引了越来越多学者的关注, 但依旧缺乏针对分形网络结构的节点影响力的系统研究. 鉴于此, 本文基于花簇分形网络模型, 研究了分形无标度结构上的节点传播影响力. 首先, 对比了不同分形维数下的节点影响力, 结果表明, 当分形维数很小时, 节点影响力的区分度几乎不随节点度变化, 很难区分不同节点的传播影响力, 而随着分形维数的增大, 从全局和局域角度都能很容易识别网络中的超级传播源. 其次, 通过对原分形网络进行不同程度的随机重连来分析网络噪声对节点影响力区分度的影响, 发现在低维分形网络上, 加入网络噪声之后能够容易区分不同节点的影响力, 而在无穷维超分形网络中, 加入网络噪声之后能够区分中间度节点的影响力, 但从全局和局域角度都很难识别中心节点的影响力. 所得结论进一步补充、深化了基于花簇分形网络的节点影响力研究, 研究结果对实际病毒传播的预警控制提供了一定的理论借鉴.     

复杂网络中心性对灾害蔓延的影响

基于一个普适性的灾害蔓延动力学模型,在三种网络拓扑结构(随机网、小世界网和无标度网)下,仿真分析了网络中心性对灾害蔓延速度和扩散趋势的影响.通过改变初始蔓延条件来分析网络初始状态对蔓延效率的影响,并着重讨论了在四种初始崩溃节点选取策略下灾害蔓延最终状态的差异.结果表明:对于四种攻击策略,网络最终状态有着明显的差异,网络对随机攻击具有较强的抵御能力,而对于目标,攻击却显示较强的脆弱性,或许,三种网络表现出不同的脆弱程度.最后,在一个实际网络上对理论分析结果进行了验证.     

基于在线社交网络的信息传播模型

本文构造了一个基于在线社交网络的信息传播模型.该模型考虑了节点度和传播机理的影响,结合复杂网络和传染病动力学理论,进一步建立了动力学演化方程组.该方程组刻画了不同类型节点随着时间的演化关系,反映了传播动力学过程受到网络拓扑结构和传播机理的影响.本文模拟了在线社交网络中的信息传播过程,并分析了不同类型节点在网络中的行为规律.仿真结果表明:由于在线社交网络的高度连通性,信息在网络中传播的门槛几乎为零;初始传播节点的度越大,信息越容易在网络中迅速传播;中心节点具有较大的社会影响力;具有不同度数的节点在网络中的变 关键词： 在线社交网络 信息传播 微分方程 传染病动力学     

复杂网络中考虑不完全免疫的病毒传播研究

复杂网络中不完全免疫包括免疫失败和免疫失效两种情况,本文研究两者同时存在对网络病毒传播行为的影响,基于平均场理论,提出一种新的传播模型.理论分析表明,免疫失败和免疫失效同时存在显著降低了网络的传播临界值,增强了病毒的感染程度.根据传播临界值与免疫节点密度、免疫成功率以及免疫失效率之间的关系,给出有效控制网络病毒传播的策略.通过数值仿真进行验证。     

一种基于用户相对权重的在线社交网络信息传播模型

根据在线社交网络信息传播特点和目前社交网络传播模型研究中存在的问题, 本文定义了网络用户之间的相互影响力函数, 在此基础上提出了一种基于用户相对权重的社交网络信息传播模型, 并对网络中的传播路径及传播过程进行了分析, 讨论了不同路径的信息传播影响力.为验证模型的有效性, 将传统的SIR模型和本文模型在六类不同网络拓扑下进行了仿真实验.仿真结果表明, 两类模型在均匀网络中没有明显差异, 但在非均匀网络中本文模型更能体现真实网络特点, 实验同时验证了节点的地位影响着信息的传播, 并且发现英文社交平台Twitter和中文社交平台新浪微博在拓扑结构上具备一定相似性.     

一种具有指数截断和局部集聚特性的网络模型

针对真实网络局域演化的特点,提出了一种具有局部集聚特性的网络演化模型——局部集聚模型(LC模型). 理论分析和模拟实验表明,LC模型的节点度服从一种具有指数截断的幂律分布,同时它的平均聚类系数要远大于局域世界模型,接近真实网络. 模拟了LC模型对恶意攻击和随机错误的抵抗力,发现高聚类系数的LC模型对恶意攻击更加脆弱. 关键词： 局部集聚 指数截断 脆弱性 无标度网络     

基于时间序列的网络失效模型

随着网络科学的发展,静态网络已不能清晰刻画网络的动态过程.在现实网络中,个体之间的交互随时间而快速演化.这种网络模式将时间与交互过程紧密联系,能够清晰刻画节点的动态过程.因此,如何更好地基于时间序列刻画网络行为变化是现有级联失效研究的重要问题.为了更好地研究该问题,本文提出一种基于时间序列的失效模型.通过随机攻击某时刻的节点,分析了时间、激活比例、连边数、连接概率4个参数对失效的影响并发现网络相变现象.同时为验证该模型的有效性与科学性,采用真实网络进行研究.实验表明,该模型兼顾时序以及传播动力学,具有较好的可行性,为解释现实动态网络的级联传播提供了参考.     

基于加权K-阶传播数的节点重要性

节点重要性对于分析网络结构具有重要意义.为了充分刻画网络全局和局部特性,本研究基于网络拓扑结构对疾病传播过程进行了抽象,分别设置各个节点为传染源,在经历传播时长K后,将网络中已感染节点的数量定义为K-阶传播数,最终基于不同K值下的K-阶传播数得到节点重要性结果.对Watts-Strogatz小世界网络和海豚网络的仿真实验表明,加权K-阶传播数法对节点重要性的评估较其他方法更为合理,能够细致地刻画小世界网络中长程连接对信息传输的影响,提高海豚网络中对社区交流起关键作用的节点的重视程度.本文利用蓄意攻击策略对美国西部电网、芝加哥公路网络、网络科学家合著网络以及小鼠神经纤维束网络进行了研究,即依照节点重要性由高到低的排序依次攻击网络.结果显示,相较于其他方法,基于加权K-阶传播数法仅需移除少量重要节点便可实现对网络结构的充分破坏.     

Mitigation strategies on scale-free networks against cascading failures

According to the dynamic characteristics of the cascading propagation, we introduce a mitigation mechanism and propose four mitigation methods on four types of nodes. By the normalized average avalanche size and a new measure, we demonstrate the efficiencies of the mitigation strategies on enhancing the robustness of scale-free networks against cascading failures and give the order of the effectiveness of the mitigation strategies. Surprisingly, we find that only adopting once mitigation mechanism on a small part of the overload nodes can dramatically improve the robustness of scale-free networks. In addition, we also show by numerical simulations that the optimal mitigation method strongly depends on the total capacities of all nodes in a network and the distribution of the load in the cascading model. Therefore, according to the protection strength for scale-free networks, by the distribution of the load and the protection price of networks, we can reasonably select how many nodes and which mitigation method to efficiently protect scale-free networks at the lower price. These findings may be very useful for avoiding various cascading-failure-induced disasters in the real world and for leading to insights into the mitigation of cascading failures.     

Sandpile Dynamics Driven by Degree on Scale-Free Networks

We introduce a sandpile model driven by degree on scale-free networks, where the perturbation is triggered at nodes with the same degree. We numerically investigate the avalanche behaviour of sandpile driven by different degrees on scale-free networks. It is observed that the avalanche area has the same behaviour with avalanche size. When the sandpile is driven at nodes with the minimal degree, the avalanches of our model behave similarly to those of the original Bak-Tang-Wiesenfeld （BTW） model on scale-free networks. As the degree of driven nodes increases from the minimal value to the maximal value, the avalanche distribution gradually changes from a clean power law, then a mixture of Poissonian and power laws, finally to a Poisson-like distribution. The average avalanche area is found to increase with the degree of driven nodes so that perturbation triggered on higher-degree nodes will result in broader spreading of avalanche propagation.     

节点中心性对复杂网络传播模式的影响分析

在众多的重要节点评估方法研究中,具有较高中心性的节点一直是关注的焦点,许多传播行为的研究也主要围绕高中心性节点展开,因此在一定程度上忽略了低中心性节点对传播行为的影响.本文从传播异构性角度,通过初始感染最大中心性节点和最小中心性节点揭示网络结构异构性对信息传播的影响.实验结果表明,传播过程中存在"链型"和"扇型"两种传播模式,在初始感染比例不断提升的情况下,两种传播模式的相互转换引发传播速率的变化,进一步促使非线性传播规模交叉现象的产生.这一现象说明,在宏观的信息传播过程中,最小中心性节点的影响力不容忽视,尤其在初始感染比例升高时,最小中心性节点比最大中心性节点更具传播优势.     

A Robustness Model of Complex Networks with Tunable Attack Information Parameter

We introduce a novel model for robustness of complex with a tunable attack information parameter. The random failure and intentional attack known are the two extreme cases of our model. Based on the model, we study the robustness of complex networks under random information and preferential information, respectively. Using the generating function method, we derive the exact value of the critical removal fraction of nodes for the disintegration of networks and the size of the giant component. We show that hiding just a small fraction of nodes randomly can prevent a scale-free network from collapsing and detecting just a small fraction of nodes preferentially can destroy a scale-free network.     

Epidemic spreading in lattice-embedded scale-free networks

We study geographical effects on the spread of diseases in lattice-embedded scale-free networks. The geographical structure is represented by the connecting probability of two nodes that is related to the Euclidean distance between them in the lattice. By studying the standard susceptible-infected model, we found that the geographical structure has great influences on the temporal behavior of epidemic outbreaks and the propagation in the underlying network: the more geographically constrained the network is, the more smoothly the epidemic spreads, which is different from the clearly hierarchical dynamics that the infection pervades the networks in a progressive cascade across smaller-degree classes in Barabási–Albert scale-free networks.     

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of São Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model.     

The emergence of scale-free networks with a seceding mechanism

In order to explore further the underlying mechanism of scale-free networks, we study stochastic secession as a mechanism for the creation of complex networks. In this evolution the network growth incorporates the addition of new nodes, the addition of new links between existing nodes, the deleting and rewiring of some existing links, and the stochastic secession of nodes. To random growing networks with preferential attachment, the model yields scale-free behavior for the degree distribution. Furthermore, we obtain an analytical expression of the power-law degree distribution with scaling exponent γ ranging from 1.1 to 9. The analytical expressions are in good agreement with the numerical simulation results.     

Robustness measurement of scale-free networks based on motif entropy

As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored. From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks.