Online social networks—Paradise of computer viruses

Online social network services have attracted more and more users in recent years. So the security of social networks becomes a critical problem. In this paper, we propose a virus propagation model based on the application network of Facebook, which is the most popular among these social network service providers. We also study the virus propagation with an email virus model and compare the behaviors of a virus spreading on Facebook with the original email network. It is found that Facebook provides the same chance for a virus spreading while it gives a platform for application developers. And a virus will spread faster in the Facebook network if users of Facebook spend more time on it.     

基于平均场理论的微博传播网络模型

微博是在通过用户关注机制建立的用户网络上分享实时信息的社交平台,而微博消息主要通过用户的转发行为使消息在用户网络上传播.掌握微博消息的传播机制,对研究微博上舆论谣言的传播、产品推广等具有指导作用.本文通过对微博传播网络的结构分析来探索微博传播过程,利用新浪微博数据,建立微博传播网络,分析该网络的生成机制,使用平均场论的方法,推导微博传播网络的度分布模型.实验结果表明:微博传播网络的度分布是时间相依的,在特定时间下网络的度分布服从幂律分布.     

Ergodic stationary distribution of a stochastic rumor propagation model with general incidence function

In daily lives, when emergencies occur, rumors will spread widely on the internet. However, it is quite difficult for the netizens to distinguish the truth of the information. The main reasons are the uncertainty of netizens' behavior and attitude, which make the transmission rates of these information among social network groups be not fixed. In this paper, we propose a stochastic rumor propagation model with general incidence function. The model can be described by a stochastic differential equation. Applying the Khasminskii method via a suitable construction of Lyapunov function, we first prove the existence of a unique solution for the stochastic model with probability one. Then we show the existence of a unique ergodic stationary distribution of the rumor model, which exhibits the ergodicity. We also provide some numerical simulations to support our theoretical results. The numerical results give us some possible methods to control rumor propagation. Firstly, increasing noise intensity can effectively reduce rumor propagation when $\widehat{\mathcal{R}}$₀>1. That is, after rumors spread widely on social network platforms, government intervention and authoritative media coverage will interfere with netizens' opinions, thus reducing the degree of rumor propagation. Secondly, speed up the rumor refutation, intensify efforts to refute rumors, and improve the scientific quality of netizen (i.e., increase the value of β and decrease the value of α and γ), which can effectively curb the rumor propagation.     

Combining social and genetic networks to study HIV transmission in mixing risk groups

Reconstruction of HIV transmission networks is important for understanding and preventing the spread of the virus and drug resistant variants. Mixing risk groups is important in network analysis of HIV in order to assess the role of transmission between risk groups in the HIV epidemic. Most of the research focuses on the transmission within HIV risk groups, while transmission between different risk groups has been less studied. We use a proposed filter-reduction method to infer hypothetical transmission networks of HIV by combining data from social and genetic scales. We modified the filtering process in order to include mixing risk groups in the model. For this, we use the information on phylogenetic clusters obtained through phylogenetic analysis. A probability matrix is also defined to specify contact rates between individuals form the same and different risk groups. The method converts the data form each scale into network forms and combines them by overlaying and computing their intersection. We apply this method to reconstruct networks of HIV infected patients in central Italy, including mixing between risk groups. Our results suggests that bisexual behavior among Italian MSM and IDU partnership are relatively important in heterosexual transmission of HIV in central Italy.     

复杂网络上的意见动力学对谣言传播的影响

通过在SIR(susceptible-infected-recovered)模型中引入抑制者对谣言的辟谣机制研究了在线社交网络上的意见动力学对谣言传播的影响.在这一模型中,节点可以与自身的邻居组成1个群,传播者可以通过该群传播信息,抑制者也可以在此群中对信息发表意见进行辟谣.辟谣机制在降低未知者对于谣言的接受概率的同时也可以促使传播者向抑制者转变.本文采用ER(Erd?s-Rényi)随机网络、无标度网络以及真实的社交网络研究了抑制者的沉默概率对于谣言传播范围的影响.首先发现,谣言传播的过程以传播者的峰值为界可以分为两个阶段,即谣言自由传播的前期以及抑制者和传播者互相制衡的后期;其次,谣言的传播会随着抑制者的沉默概率的增大而突然暴发.在谣言暴发阈值之下,沉默概率的增大不会导致谣言传播范围显著增大,这是由于未知者在感知到谣言并转变为传播者后又迅速转变为抑制者;而当沉默概率达到谣言暴发阈值时,抑制者将不能控制传播者对谣言的传播从而导致抑制者的降低和谣言的暴发;最后,无标度上的谣言自由传播的前期阶段比随机网络持续的时间更短,从而使无标度上的谣言更难以暴发.本文的模型综合考虑了意见动力学和谣言传播的相互作用,更加真实地模拟了真实世界社交网络中的谣言传播过程.为谣言传播的控制和干预提供了一些有用的思路和见解.     

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

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

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

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

A virus spreading model for cognitive radio networks

Since cognitive radio (CR) networks could solve the spectrum scarcity problem, they have drawn much research in recent years. Artificial intelligence(AI) is introduced into CRs to learn from and adapt to their environment. Nonetheless, AI brings in a new kind of attacks specific to CR networks. The most powerful one is a self-propagating AI virus. And no spreading properties specific to this virus have been reported in the literature. To fill this research gap, we propose a virus spreading model of an AI virus by considering the characteristics of CR networks and the behavior of CR users. Several important observations are made from the simulation results based on the model. Firstly, the time taken to infect the whole network increases exponentially with the network size. Based on this result, CR network designers could calculate the optimal network size to slow down AI virus propagation rate. Secondly, the anti-virus performance of static networks to an AI virus is better than dynamic networks. Thirdly, if the CR devices with the highest degree are initially infected, the AI virus propagation rate will be increased substantially. Finally, it is also found that in the area with abundant spectrum resource, the AI virus propagation speed increases notably but the variability of the spectrum does not affect the propagation speed much.     

A model for the spread of rumors in Barrat–Barthelemy–Vespignani (BBV) networks

Rumor propagation is a typical form of social communication and plays a significant role in social life. In this paper, we studied the process of rumor propagation by accounting for the mechanism of forgetting in Barrat–Barthelemy–Vespignani (BBV) networks. First, we derived mean-field equations for rumor propagation based on the strength of the nodes in the propagation network. We then analyzed the stability of the model to determine whether a propagation threshold existed in the BBV networks. We also conducted numerical simulations of the BBV networks and found that rumors propagate more slowly in BBV networks than in unweighted networks. The numerical simulation results also demonstrated that as the forgetting rate increases, the rumor’s influence decreases in both BBV networks and unweighted networks. Finally, the simulation results confirmed that a threshold exists for rumor propagation in BBV networks, but that it was independent of the value of the stifling rate.     

基于有向网络的Email病毒传播模型及其震荡吸引子研究

基于有向Email网络和Email病毒传播特点,运用平均场方法建立Email病毒传播的时滞微分方程模型,研究Email病毒在有向网络中的震荡传播行为.理论上给出了震荡解的全局吸引子存在的充要条件,数值实验验证了吸引子的存在性和控制.研究表明,子图之间的传播概率决定吸引子的存在性,而有效传播率影响吸引子的振幅,因此这两个参数对于有效预测和控制Email病毒在网络上的传播规模具有重要意义.     

Modular and hierarchical structure of social contact networks

Social contact networks exhibit overlapping qualities of communities, hierarchical structure and spatial-correlated nature. We propose a mixing pattern of modular and growing hierarchical structures to reconstruct social contact networks by using an individual’s geospatial distribution information in the real world. The hierarchical structure of social contact networks is defined based on the spatial distance between individuals, and edges among individuals are added in turn from the modular layer to the highest layer. It is a gradual process to construct the hierarchical structure: from the basic modular model up to the global network. The proposed model not only shows hierarchically increasing degree distribution and large clustering coefficients in communities, but also exhibits spatial clustering features of individual distributions. As an evaluation of the method, we reconstruct a hierarchical contact network based on the investigation data of a university. Transmission experiments of influenza H1N1 are carried out on the generated social contact networks, and results show that the constructed network is efficient to reproduce the dynamic process of an outbreak and evaluate interventions. The reproduced spread process exhibits that the spatial clustering of infection is accordant with the clustering of network topology. Moreover, the effect of individual topological character on the spread of influenza is analyzed, and the experiment results indicate that the spread is limited by individual daily contact patterns and local clustering topology rather than individual degree.     

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

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

Velocity and hierarchical spread of epidemic outbreaks in scale-free networks

We study the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics. The growth time scale of outbreaks is inversely proportional to the network degree fluctuations, signaling that epidemics spread almost instantaneously in networks with scale-free degree distributions. This feature is associated with an epidemic propagation that follows a precise hierarchical dynamics. Once the highly connected hubs are reached, the infection pervades the network in a progressive cascade across smaller degree classes. The present results are relevant for the development of adaptive containment strategies.     

无标度网络中最大传染能力限定的病毒传播问题研究

传统的病毒传播模型在无限大无标度网络上不存在病毒传播阈值,即无论病毒的传播速率多么低,病毒始终能够在网络中传播.但研究发现,这个结论是在网络中存在超级传染者的假设下得到的,然而许多真实的无标度网络中并不存在超级传染者.因此,文章提出了一个最大传染能力限定的病毒传播模型,并从理论上证明了在最大传染能力限定的无限大无标度网络上,病毒传播阈值是存在的;同时,也分析了最大传染能力限定下非零传播阈值与有限规模网络下非零传播阈值的本质区别,并解释了为什么人们总是认为传统病毒传播模型对许多真实网络病毒感染程度估计过高的 关键词： 无标度网络 最大传染能力 传播阈值 感染程度     

Cascade dynamics of complex propagation

Random links between otherwise distant nodes can greatly facilitate the propagation of disease or information, provided contagion can be transmitted by a single active node. However, we show that when the propagation requires simultaneous exposure to multiple sources of activation, called complex propagation, the effect of random links can be just the opposite; it can make the propagation more difficult to achieve. We numerically calculate critical points for a threshold model using several classes of complex networks, including an empirical social network. We also provide an estimation of the critical values in terms of vulnerable nodes.     

Dynamics of organizational rumor communication on connecting multi-small-world networks

We study the dynamics of an epidemic-like model for the spread of a rumor on a connecting multi-small-world-network (CM-SWN) model, which represents organizational communication in the real world. It has been shown that this model exhibits a transition between regimes of localization and propagation at a finite value of network randomness. Here, by numerical means, we perform a quantitative characterization of the evolution in the three groups under two evolution rules, namely the conformity and obeying principles. The variant of a dynamic CM-SWN, where the quenched disorder of small-world networks is replaced by randomly changing connections between individuals in a single network and stable connection by star nodes between networks, is also analysed in detail and compared with a mean-field approximation.     

Dynamics of organizational rumor communication on connecting multi-small-world networks

We study the dynamics of an epidemic-like model for the spread of a rumor on a connecting multi-small-world-network (CM-SWN) model, which represents organizational communication in the real world. It has been shown that this model exhibits a transition between regimes of localization and propagation at a finite value of network randomness. Here, by numerical means, we perform a quantitative characterization of the evolution in the three groups under two evolution rules, namely the conformity and obeying principles. The variant of a dynamic CM-SWN, where the quenched disorder of small-world networks is replaced by randomly changing connections between individuals in a single network and stable connection by star nodes between networks, is also analysed in detail and compared with a mean-field approximation.     

A random walk evolution model of wireless sensor networks and virus spreading

In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks (WSNs) due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations.     

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

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