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.     

考虑谣言清除过程的网络谣言传播与抑制

网络谣言传播是网络传播动力学的重要课题之一. 网络谣言传播常常同时混杂谣言感染和谣言清除两个过程, 对这一现象的分析可以帮助我们更好地认识社会网络中的信息传播. 本文在susceptible-infective-refractory谣言传播模型的基础上增加谣言清除者, 定义了谣言感染和谣言清除的规则, 提出SIERsEs谣言传播模型, 建立了模型的平均场方程, 从理论上分析了谣言传播的稳态, 并求解出谣言传播的感染阈值和清除阈值. 仿真计算分析了感染和清除过程同时作用时, 感染率、清除率和网络平均度对谣言传播的影响. 研究发现, 网络平均度过小或过大, 谣言传播稳定后的影响力都将处于低水平. 分析了目标免疫和熟人免疫等传统免疫策略的不足, 针对网络环境下谣言抑制的特点, 提出主动免疫和被动免疫两种网络谣言免疫策略, 并研究了传播者遗忘率、清除者遗忘率和开始免疫时间参数对这两种谣言免疫策略有效性的影响. 需要重视的是: 研究发现一些直观看来有效的谣言抑制措施反而可能提高谣言的影响力. 研究结果有助于深化对于网络传播动力学的理解, 同时为发展有效的网络谣言抑制策略提供新的思路.     

A rumor spreading model with variable forgetting rate

A rumor spreading model with the consideration of forgetting rate changing over time is examined in small-world networks. The mean-field equations are derived to describe the dynamics of rumor spreading in small-world networks. Further, numerical solutions are conducted on LiveJournal, an online social blogging platform, to better understand the performance of the model. Results show that the forgetting rate has a significant impact on the final size of rumor spreading: the larger the initial forgetting rate or the faster the forgetting speed, the smaller the final size of the rumor spreading. Numerical solutions also show that the final size of rumor spreading is much larger under a variable forgetting rate compared to that under a constant forgetting rate.     

Assembly effect of groups in online social networks

Due to the popularity and growth of online social networks, security in these networks becomes a critical problem. Previous works have proved that a virus can spread effectively in social networks. In this paper, groups in social networks are studied. We notice that groups on social network services sites can assemble people with similar characteristics, which may promote virus propagation in these networks. After our analysis, it is found that the use of groups can shorten the distance among users, and hence it would cause faster virus spread. We propose a virus propagation model and simulate it in a group network to show the assembly effect of groups. Our result shows that even with only one random attack, a virus can still spread rapidly, and the direct contact among group members is the reason for fast spreading.     

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.     

Synchronization speed of identical oscillators on community networks

Synchronizability of complex oscillators networks has attracted much research interest in recent years. In contrast, in this paper we investigate numerically the synchronization speed, rather than the synchronizability or synchronization stability, of identical oscillators on complex networks with communities. A new weighted community network model is employed here, in which the community strength could be tunable by one parameter δ. The results showed that the synchronization speed of identical oscillators on community networks could reach a maximal value when δ is around 0.1. We argue that this is induced by the competition between the community partition and the scale-free property of the networks. Moreover, we have given the corresponding analysis through the second least eigenvalue λ₂ of the Laplacian matrix of the network which supports the previous result that the synchronization speed is determined by the value of λ₂.     

Modular Epidemic Spreading in Small-World Networks

We study the epidemic spreading of the susceptible-infected-susceptible model on small-world networks with modular structure. It is found that the epidemic threshold increases linearly with the modular strength. Furthermore, the modular structure may influence the infected density in the steady state and the spreading velocity at the beginning of propagation. Practically, the propagation can be hindered by strengthening the modular structure in the view of network topology. In addition, to reduce the probability of reconnection between modules may also help to control the propagation.     

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.     

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

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

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

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

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

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

SIHR rumor spreading model in social networks

There are significant differences between rumor spreading and epidemic spreading in social networks, especially with consideration of the mutual effect of forgetting and remembering mechanisms. In this paper, a new rumor spreading model, Susceptible-Infected-Hibernator-Removed (SIHR) model, is developed. The model extends the classical Susceptible-Infected-Removed (SIR) rumor spreading model by adding a direct link from ignorants to stiflers and a new kind of people-Hibernators. We derive mean-field equations that describe the dynamics of the SIHR model in social networks. Then a steady-state analysis is conducted to investigate the final size of the rumor spreading under various spreading rate, stifling rate, forgetting rate, and average degree of the network. We discuss the spreading threshold and find the relationship between the final size of the rumor and two probabilities. Also Runge-Kutta method is used for numerical simulation which shows that the direct link from the ignorants to the stiflers advances the rumor terminal time and reduces the maximum rumor influence. Moreover, the forgetting and remembering mechanisms of hibernators postpone the rumor terminal time and reduce the maximum rumor influence.     

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

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

A spectrum handoff scheme for optimal network selection in Cognitive Radio vehicular networks: A game theoretic auction theory approach

The recent strides in vehicular networks have emerged as a convergence of multi radio access networks having different user preferences, multiple application requirements and multiple device types. In future Cognitive Radio (CR) vehicular networks deployment, multiple radio access networks may coexist in the overlapping areas having different characteristics in terms of multiple attributes. Hence, it becomes a challenge for CR vehicular node to select the optimal network for the spectrum handoff decision. A game theoretic auction theory approach is interdisciplinary effective approach to select the optimal network for spectrum handoff. The competition between different CR vehicular node and access networks can be formulated as multi-bidder bidding to provide its services to CR vehicular node. The game theory is the branch of applied mathematics which make intelligent decision to select the optimal alternative from predetermined alternatives. Hence, this paper investigates a spectrum handoff scheme for optimal network selection using game theoretic auction theory approach in CR vehicular networks. The paper has also proposed a new cost function based multiple attribute decision making method which outperforms other existing methods. Numerical results revel that the proposed scheme is effective for spectrum handoff for optimal network selection among multiple available networks.     

Virus spreading in wireless sensor networks with a medium access control mechanism

In this paper, an extended version of standard susceptible-infected (SI) model is proposed to consider the influence of a medium access control mechanism on virus spreading in wireless sensor networks. Theoretical analysis shows that the medium access control mechanism obviously reduces the density of infected nodes in the networks, which has been ignored in previous studies. It is also found that by increasing the network node density or node communication radius greatly increases the number of infected nodes. The theoretical results are confirmed by numerical simulations.     

Analysis of mobility impact on interference in cognitive radio networks

Cognitive radio (CR) technology seems to be a promising candidate for solving the radio frequency (RF) spectrum occupancy problem. CRs strive to utilize the white holes in the RF spectrum in an opportunistic manner. Because interference is an inherent and a very critical design parameter for all sorts of wireless communication systems, many of the recently emerging wireless technologies prefer smaller size coverage with reduced transmit power in order to decrease interference. Prominent examples of short-range communication systems trying to achieve low interference power levels are CR relays in CR networks and femtocells in next generation wireless networks (NGWNs). It is clear that a comprehensive interference model including mobility is essential especially in elaborating the performance of such short-range communication scenarios. Therefore, in this study, a physical layer interference model in a mobile radio communication environment is investigated by taking into account all of the basic propagation mechanisms such as large- and small-scale fading under a generic single primary user (PU) and single secondary user (SU) scenario. Both one-dimensional (1D) and two-dimensional (2D) random walk models are incorporated into the physical layer signal model. The analysis and corresponding numerical results are given along with the relevant discussions.     

A Simplified Neuronal Model for the Instigation and Propagation of Cortical Spreading Depression

In this paper, we construct a simplified neuronal model that is capable of simulating the instigation of cortical spreading depression (CSD) and propagation of a CSD wave. Our model is a simplification and extension of a single neuron model proposed in the literature for studying the instigation of CSD. Using the simplified neuronal model, we construct a network of these simplified neurons. This network model shows that the propagation of a CSD wave occurs naturally after it is instigated electrically or chemically. Although the model is simple, the speed of the CSD wave predicted by our model is consistent with experimentally observed values. Finally, our model allows us to investigate the effects of specific ion channels on the spread of a CSD wave.     

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.     

Damage spreading and criticality in finite random dynamical networks

We systematically study and compare damage spreading at the sparse percolation (SP) limit for random Boolean and threshold networks with perturbations that are independent of the network size N. This limit is relevant to information and damage propagation in many technological and natural networks. Using finite-size scaling, we identify a new characteristic connectivity Ks, at which the average number of damaged nodes d[over ], after a large number of dynamical updates, is independent of N. Based on marginal damage spreading, we determine the critical connectivity Kc(sparse)(N) for finite N at the SP limit and show that it systematically deviates from Kc, established by the annealed approximation, even for large system sizes. Our findings can potentially explain the results recently obtained for gene regulatory networks and have important implications for the evolution of dynamical networks that solve specific tasks.     

社交网络中信息传播的稳定性研究

社交网络已成为当前最重要的信息传播媒体之一,因此有必要研究信息在社交网络上的传播规律.本文探索了包含遏制机制和遗忘机制的信息传播机理,提出了信息传播的模型,给出了信息传播的规则,建立了相应的平均场方程,计算了平衡点和基本再生数R_0,并从理论上证明了平衡点的渐进稳定性.仿真实验分析了遏制机制、遗忘机制等因素对信息传播过程的影响,并验证了所得结论的正确性.