Theory of rumour spreading in complex social networks

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.     

Dynamic properties of epidemic spreading on finite size complex networks

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS （susceptibleinfected-susceptible） model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.     

Absence of epidemic threshold in scale-free networks with degree correlations

Random scale-free networks have the peculiar property of being prone to the spreading of infections. Here we provide for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing. Degree correlations result therefore irrelevant for the epidemic spreading picture in these scale-free networks. The present result is related to the divergence of the average nearest neighbor's degree, enforced by the degree detailed balance condition.     

Epidemic spreading on a scale-free network with awareness

This paper presents a modified susceptible-infected-recovered(SIR) model with the effects of awareness and vaccination to study the epidemic spreading on scale-free networks based on the mean-field theory.In this model,when susceptible individuals receive awareness from their infected neighbor nodes,they will take vaccination measures.The theoretical analysis and the numerical simulations show that the existence of awareness and vaccination can significantly improve the epidemic threshold and reduce the risk of virus outbreaks.In addition,regardless of the existence of vaccination,the awareness can increase the spreading threshold and slow the spreading speed effectively.For a given awareness and a certain spreading rate,the total number of infections reduces with the increasing vaccination rate.     

Rumor spreading model considering forgetting and remembering mechanisms in inhomogeneous networks

The SIHR rumor spreading model with consideration of the forgetting and remembering mechanisms was studied in homogeneous networks. We further investigate the properties of the SIHR model in inhomogeneous networks. The SIHR model is refined and mean-field equations are derived to describe the dynamics of the rumor spreading model in inhomogeneous networks. Steady-state analysis is carried out, which shows no spreading threshold existing. Numerical simulations are conducted in a BA scale-free network. The simulation results show that the network topology exerts significant influences on the rumor spreading: In comparison with the ER network, the rumor spreads faster and the final size of the rumor is smaller in BA scale-free network; the forgetting and remembering mechanisms greatly impact the final size of the rumor. Finally, through the numerical simulation, we examine the effects that the spreading rate and the stifling rate have on the the influence of the rumor. In addition, the no threshold result is verified.     

An Efficient Control Strategy of Epidemic Spreading on Scale-Free Networks

We present a novel and effective method for controlling epidemic spreading on complex networks, especially on scale-free networks. The proposed strategy is performed by deleting edges according to their significances （the significance of an edge is defined as the product of the degrees of two nodes of this edge）. In contrast to other methods, e.g., random immunization, proportional immunization, targeted immunization, acquaintance immunization and so on, which mainly focus on how to delete nodes to realize the control of epidemic spreading on complex networks, our method is more effective in realizing the control of epidemic spreading on complex networks, moreover, such a method can better retain the integrity of complex networks.     

手机短信息传播过程和短信息寿命研究

比较了短信息在无标度网络、小世界网络和实际的短信息网络三种网络中的传播过程,寻找影响短信息传播的因素.研究发现,网络拓扑结构和手机用户的转发短信行为均会影响短信息传播过程.在无标度网络中短信息传播速率快于小世界网络和实际的短信息网络,而无标度网络的短信息寿命较小世界网络和实际的短信息网络短;网络中手机用户的转发短信息行为明显影响短信息的传播过程.同时还发现短信息寿命与网络直径有关. 关键词： 复杂网络 短信息 信息传播 人类行为     

The effect of infected external computers on the spread of viruses: A compartment modeling study

Inevitably, there exist infected computers outside of the Internet. This paper aims to understand how infected external computers affect the spread of computer viruses. For that purpose, a new virus–antivirus spreading model, which takes into account the effect of infected/immune external computers, is established. A systematic study shows that, unlike most previous models, the proposed model admits no virus-free equilibrium and admits a globally asymptotically stable viral equilibrium. This result implies that it would be practically impossible to eradicate viruses on the Internet. As a result, inhibiting the virus prevalence to below an acceptable level would be the next best thing. A theoretical study reveals the effect of different parameters on the steady virus prevalence. On this basis, a number of suggestions are made so as to contain virus spreading.     

Modelling one-dimensional driven diffusive systems by the Zero-Range Process

In order to characterize networks in the scale-free network class we study the frequency of cycles of length h that indicate the ordering of network structure and the multiplicity of paths connecting two nodes. In particular we focus on the scaling of the number of cycles with the system size in off-equilibrium scale-free networks. We observe that each off-equilibrium network model is characterized by a particular scaling in general not equal to the scaling found in equilibrium scale-free networks. We claim that this anomalous scaling can occur in real systems and we report the case of the Internet at the Autonomous System Level.Received: 15 January 2004, Published online: 14 May 2004PACS: 89.75.-k Complex systems - 89.75.Hc Networks and genealogical trees     

无标度网络上的传播动力学

介绍了无标度网络上的传播动力学,在susceptible-infected-susceptible（SIS）模型的基础上考察了一般情况下无标度网络中疾病爆发的临界点问题,得出了关于临界点一般性的表达式.得到的结果在特殊情况下分别退化为已有的一些经典结论.同时分别讨论了这些情况的建模意义和可靠性. 关键词： 无标度网络 传播动力学 susceptible-infected-susceptible模型 临界点     

Probabilistic prediction in scale-free networks: diameter changes

In complex systems, responses to small perturbations are too diverse to definitely predict how much they would be, and then such diverse responses can be predicted in a probabilistic way. Here we study such a problem in scale-free networks, for example, the diameter changes by the deletion of a single vertex for various in silico and real-world scale-free networks. We find that the diameter changes are indeed diverse and their distribution exhibits an algebraic decay with an exponent zeta asymptotically. Interestingly, the exponent zeta is robust as zeta approximately 2.2(1) for most scale-free networks and insensitive to the degree exponents gamma as long as 2相似文献   

Modelling of discrete-time SIS models with awareness interactions on degree-uncorrelated networks

Many epidemic models ignored the impact of awareness on epidemics in a population, though it is not the case from the real viewpoints. In this paper, a discrete-time SIS model with awareness interactions on degree-uncorrelated networks is considered. We study three kinds of awareness, including local awareness and global awareness which are originated from the epidemic-dependent information, and individual awareness which is epidemic-independent and determined by the individual information. We demonstrate analytically that awareness of the epidemic-dependent information cannot change the epidemic threshold regardless of the global or local spreading information. In contrast, epidemic-independent awareness to individual information increases the epidemic threshold in finite scale-free networks, but cannot halt the absence of epidemic threshold in an infinite scale-free network. By numerical simulations, we find that local awareness has a stronger impact on epidemic prevalence than global awareness. Our findings explore the effects of various types of awareness on epidemic spreading and address their roles in the epidemic control.     

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.     

有倾向性重连产生的反匹配网络

在具有网络结构的系统中度关联属性对于动力学行为具有重要的影响, 所以产生适当度关联网络的方法对于大量网络系统的研究具有重要的作用. 尽管产生正匹配网络的方法已经得到很好的验证, 但是产生反匹配网络的方法还没有被系统的讨论过. 重新连接网络中的边是产生度关联网络的一个常用方法. 这里我们研究使用重连方法产生反匹配无标度网络的有效性. 我们的研究表明, 有倾向的重连可以增强网络的反匹配属性. 但是有倾向重连不能使皮尔森度相关系数下降到-1, 而是存在一个依赖于网络参数的最小值. 我们研究了网络的主要参数对于网络度相关系数的影响, 包括网络尺寸, 网络的连接密度和网络节点的度差异程度. 研究表明在网络尺寸大的情况下和节点度差异性强的情况下, 重连的效果较差. 我们研究了真实Internet网络, 发现模型产生的网络经过重连不能达到真实网络的度关联系数.     

Epidemic spreading on networks with vaccination

In this paper, a new susceptible-infected-susceptible (SIS) model on complex networks with imperfect vaccination is proposed. Two types of epidemic spreading patterns (the recovered individuals have or have not immunity) on scale-free networks are discussed. Both theoretical and numerical analyses are presented. The epidemic thresholds related to the vaccination rate, the vaccination-invalid rate and the vaccination success rate on scale-free networks are demonstrated, showing different results from the reported observations. This reveals that whether or not the epidemic can spread over a network under vaccination control is determined not only by the network structure but also by the medicine's effective duration. Moreover, for a given infective rate, the proportion of individuals to vaccinate can be calculated theoretically for the case that the recovered nodes have immunity. Finally, simulated results are presented to show how to control the disease prevalence.     

The Influence of Human Heterogeneity to Information Spreading

Humans are an integral part of the wide world and material areas, and morphological difference is widespread. In this paper, we propose a model to emphasize the influence of human heterogeneity to information spreading on social networks, and the properties including memory effects, social reinforcement, non-redundancy and human heterogeneity are taken into account. Simulation results indicate that the small-world networks generate the most effective spreading for the stronger human heterogeneity; however, for the weaker human heterogeneity, the regular networks will be more effective. In addition, for a given BA scale-free network, the stronger human heterogeneity will be more conducive to information spreading.     

同时考虑传染媒介和传播延迟的复杂网络病毒传播行为研究

提出一种新的流行病传播模型,基于平均场理论,研究传染媒介和传播延迟同时存在对网络中流行病传播行为的影响.理论分析和仿真结果表明,传染媒介和传播延迟同时存在显著增强了网络中流行病爆发的危险性,并加速了流行病的传播.研究还发现,对于给定的有效传播率,均匀网络中流行病的感染程度分别与传染媒介的传染概率和传播延迟呈对数关系,无标度网络中流行病的感染程度与传染媒介的传染概率呈幂率关系,而与传播延迟之间则存在线性关系。     

Modeling the IPv6 internet AS-level topology

To measure the IPv6 internet AS-level topology, a network topology discovery system, called Dolphin, was developed. By comparing the measurement result of Dolphin with that of CAIDA’s Scamper, it was found that the IPv6 Internet at AS level, similar to other complex networks, is also scale-free but the exponent of its degree distribution is 1.2, which is much smaller than that of the IPv4 Internet and most other scale-free networks. In order to explain this feature of IPv6 Internet we argue that the degree exponent is a measure of uniformity of the degree distribution. Then, for the purpose of modeling the networks, we propose a new model based on the two major factors affecting the exponent of the EBA model. It breaks the lower bound of degree exponent which is 2 for most models. To verify the validity of this model, both theoretical and experimental analyses have been carried out. Finally, we demonstrate how this model can be successfully used to reproduce the topology of the IPv6 Internet.     

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

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