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

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

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

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

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

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

基于元胞自动机考虑传播延迟的复杂网络病毒传播研究

基于元胞自动机,研究传播延迟对复杂网络病毒传播动力学行为的影响,提出一种新的易染状态-感染状态-易染状态(SIS)传播模型.研究表明,传播延迟的存在显著降低了网络的传播临界值,增强了网络中病毒爆发的危险性.研究还发现,随着传播延迟的增大,病毒的感染程度以及传播速率都明显增大.此外,SIS传播模型不仅能够反映病毒的平均传播趋势,而且可以描述病毒随时间的动态演化过程以及病毒的爆发和消亡等概率事件,从而有效地克服了利用平均场方法构建的微分方程模型只能反映病毒平均传播趋势的局限性.同时,还给出有效控制网络中病毒传 关键词： 复杂网络 病毒传播 元胞自动机 传播延迟     

具有局部结构的增长无标度网络中传染病传播机制研究

为了研究人群中的一些基本的社会关系结构,如家庭、室友、同事等,对传染病传播过程的影响机制,本文建立了一个具有局部结构的增长无标度网络模型.研究表明,局部结构的引入使得该网络模型能够同时再现社会网络的两个重要特征：节点度分布的不均匀性以及节点度之间的相关性.首先,该网络的节点度和局部结构度均服从幂律分布,且度分布指数依赖于局部结构的大小.此外,局部结构的存在还导致网络节点度之间具有正相关特性,而这种正相关正是社会网络所特有的一个重要特性.接着,通过理论分析和数值模拟,我们进一步研究了该网络结构对易感者-感染 关键词： 复杂网络 无标度网络 局部结构 传染病建模     

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

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

Epidemic spreading in a finite-precision BA model

The Barabasi-Albert (BA) model with finite-precision preferential attachment is used to build a wide range of network structures. Spreading epidemics and collective dynamics are investigated on such complex networks. Numerical simulations reveal a transition from an exponential scaling to a power-law distribution of link numbers per node along with the increase of the tuning parameter ω. The collective synchronization induced by the Susceptible-Infected-Recovered-Susceptible (SIRS) epidemiological process is shown to depend on the topological structure of the network.     

Disease dynamics in a dynamic social network

We develop a framework for simulating a realistic, evolving social network (a city) into which a disease is introduced. We compare our results to prevaccine era measles data for England and Wales, and find that they capture the quantitative and qualitative features of epidemics in populations spanning two orders of magnitude. Our results provide unique insight into how and why the social topology of the contact network influences the propagation of the disease through the population. We argue that network simulation is suitable for concurrently probing contact network dynamics and disease dynamics in ways that prior modeling approaches cannot and it can be extended to the study of less well-documented diseases.     

Epidemic spreading in a scale-free network of regular lattices

The susceptible-infected-susceptible (SIS) epidemics in a scale-free network in which each node is a square lattice itself is investigated through large-scale computer simulations. The model combines a local contact process among individuals in a node (or city) with stochastic long-range infections due to people traveling between cities interconnected by the national transportation scale-free network. A nonzero epidemic threshold is found and it is approached with a power-law behavior by the density of infected individuals, as observed in the small-world network of Watts and Strogatz. Also, the epidemic propagation follows a 1/f$1/f$, hierarchical dynamics from the highly connected square lattices to the smaller degree nodes in outbreaks with sizes distributed accordingly a Gaussian function.     

Improved functional-weight approach to oscillatory patterns in excitable networks

Studies of sustained oscillations on complex networks with excitable node dynamics received much interest in recent years. Although an individual unit is non-oscillatory, they may organize to form various collective oscillatory patterns through networked connections. An excitable network usually possesses a number of oscillatory modes dominated by different Winfree loops and numerous spatiotemporal patterns organized by different propagation path distributions. The traditional approach of the so-called dominant phase-advanced drive method has been well applied to the study of stationary oscillation patterns on a network. In this paper, we develop the functional-weight approach that has been successfully used in studies of sustained oscillations in gene-regulated networks by an extension to the high-dimensional node dynamics. This approach can be well applied to the study of sustained oscillations in coupled excitable units. We tested this scheme for different networks, such as homogeneous random networks, small-world networks, and scale-free networks and found it can accurately dig out the oscillation source and the propagation path. The present approach is believed to have the potential in studies competitive non-stationary dynamics.     

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

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

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.     

Transient dynamics of sparsely connected Hopfield neural networks with arbitrary degree distributions

Using probabilistic approach, the transient dynamics of sparsely connected Hopfield neural networks is studied for arbitrary degree distributions. A recursive scheme is developed to determine the time evolution of overlap parameters. As illustrative examples, the explicit calculations of dynamics for networks with binomial, power-law, and uniform degree distribution are performed. The results are good agreement with the extensive numerical simulations. It indicates that with the same average degree, there is a gradual improvement of network performance with increasing sharpness of its degree distribution, and the most efficient degree distribution for global storage of patterns is the delta function.     

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

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

基于元胞自动机的复杂信息系统安全风险传播研究

基于元胞自动机建立复杂信息系统安全风险传播模型, 研究复杂信息系统安全风险在最近邻耦合网络、 随机网络,　Watts-Strogatz 小世界网络和Barabasi-Albert无标度网络 四种网络拓扑下的传播问题. 通过研究安全风险传播模型在四种网络拓扑下安全风险的传播阈值, 与现有的传播阈值研究成果进行比较, 验证模型的正确性, 并分析验证网络拓扑结构中度分布的异质化程度越高传播阈值越小的结论. 通过对安全风险的传播演化趋势进行研究, 分析验证网络度分布的异质化程度越高、安全风险影响范围越小、传播速度越快的结论, 并指出度分布的异质化程度越高、模型后期的免疫机制对控制安全风险传播的效果越缓慢. 通过对安全风险在传播最早期就趋于消亡的情况进行研究, 分析得出安全风险在传播之初就趋于消亡的消亡率与传播率之间呈现近似负指数的关系, 并且初期的感染源越多安全风险的消亡率越低. 分析了影响复杂信息系统安全风险传播的关键要素, 对复杂信息系统中安全风险传播的控制具有指导作用. 关键词： 复杂信息系统 复杂网络 安全风险传播 元胞自动机     

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

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

Epidemic threshold and phase transition in scale-free networks with asymmetric infection

We study the SIS epidemic dynamics on scale-freeweighted networks with asymmetric infection, by both analysis andnumerical simulations, with focus on the epidemic threshold aswell as critical behaviors. It is demonstrated that the asymmetryof infection plays an important role: we could redistribute theasymmetry to balance the degree heterogeneity of the network andthen to restore the epidemic threshold to a fnite value. On theother hand, we show that the absence of the epidemic threshold isnot so bad as commented previously since the prevalence grows veryslowly in this case and one could only protect a few vertices toprevent the diseases propagation.     

Accelerating networks: Effects of preferential connections

Networks are commonly observed structures in complex systems with interacting and interdependent parts that self-organize. For nonlinearly growing networks, when the total number of connections increases faster than the total number of nodes, the network is said to accelerate. We propose a systematic model for the dynamics of growing networks represented by distribution kinetics equations. We define the nodal-linkage distribution, construct a population dynamics equation based on the association-dissociation process, and perform the moment calculations to describe the dynamics of such networks. For nondirectional networks with finite numbers of nodes and connections, the moments are the total number of nodes, the total number of connections, and the degree (the average number of connections per node), represented by the average moment. Size independent rate coefficients yield an exponential network describing the network without preferential attachment, and size dependent rate coefficients produce a power law network with preferential attachment. The model quantitatively describes accelerating network growth data for a supercomputer (Earth Simulator), for regulatory gene networks, and for the Internet.     

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

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

Scaling of the propagation of epidemics in a system of mobile agents

For a two-dimensional system of agents modeled by molecular dynamics, we simulate epidemics spreading, which was recently studied on complex networks. Our resulting network model is time-evolving. We study the transitions to spreading as function of density, temperature and infection time. In addition, we analyze the epidemic threshold associated to a power-law distribution of infection times.