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

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

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

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

节点抗攻击存在差异的无尺度网络恶意软件传播研究

在考虑节点抗攻击能力存在差异情形下,研究了恶意软件在无尺度网络中的传播行为.基于元胞自动机理论,建立了节点具有攻击差异的恶意软件传播模型.通过定义脆弱性函数,以描述不同度节点的抗攻击差异,使得模型更具普遍性.研究了不同形式的脆弱性函数对恶意软件在无尺度网络中的传播临界值和时间演化的影响.研究表明,节点抗攻击能力的差异对传播行为会产生重要影响,如导致传播临界值改变、传播速度减缓.研究指出,脆弱性函数是网络选择适合的免疫策略的重要依据.     

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

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

自适应网络中病毒传播的稳定性和分岔行为研究

自适应复杂网络是以节点状态与拓扑结构之间存在反馈回路为特征的网络. 针对自适应网络病毒传播模型, 利用非线性微分动力学系统研究病毒传播行为; 通过分析非线性系统对应雅可比矩阵的特征方程, 研究其平衡点的局部稳定性和分岔行为, 并推导出各种分岔点的计算公式. 研究表明, 当病毒传播阈值小于病毒存在阈值, 即R₀0^c时, 网络中病毒逐渐消除, 系统的无病毒平衡点是局部渐近稳定的; R₀^c0<1时, 网络出现滞后分岔, 产生双稳态现象, 系统存在稳定的无病毒平衡点、较大稳定的地方病平衡点和较小不稳定的地方病平衡点; R₀>1时, 网络中病毒持续存在, 系统唯一的地方病平衡点是局部渐近稳定的. 研究发现, 系统先后出现了鞍结分岔、跨临界分岔、霍普夫分岔等分岔行为. 最后通过数值仿真验证所得结论的正确性. 关键词： 自适应网络 稳定性 分岔 基本再生数     

非线性网络的动力学复杂性研究

综述了非线性网络的动力学复杂性研究在网络理论、实证和应用方面所取得的主要进展和重要成果;深刻揭示了复杂网络的若干复杂性特征与基本定量规律;提出和建立了网络科学的统一混合理论体系(三部曲)和网络金字塔,并引入一类广义Farey组织的网络家族,阐明网络的复杂性-简单性与多样性-普适性之间转变关系;揭示了网络的拓扑结构特征与网络的动态特性之间关系;建立具有长程连接的规则网络的部分同步理论并应用于随机耦合的时空非线性系统的同步;提出复杂网络的动力学同步与控制多种方法;提出若干提高同步能力的模型、方法和途径,如同步最优和同步优先模型、同步与网络特征量关系、权重作用、叶子节点影响等;提出复杂混沌网络的多目标控制及具有小世界和无标度拓扑的束流输运网络的束晕一混沌控制方法;提出集群系统的自适应同步模型及蜂拥控制方法;探讨网络上拥塞与路由控制、资源博弈及不同类型网络上传播的若干规律;揭示含权经济科学家合作网及其演化特点;实证研究并揭示了多层次的高科技企业网和若干社会网络的特点;提出一种复杂网络的非平衡统计方法,把宏观网络推进到微观量子网络.     

非线性网络的动力学复杂性研究

综述了非线性网络的动力学复杂性研究在网络理论、实证和应用方面所取得的主要进展和重要成果;深刻揭示了复杂网络的若干复杂性特征与基本定量规律;提出和建立了网络科学的统一混合理论体系(三部曲)和网络金字塔,并引入一类广义Farey组织的网络家族,阐明网络的复杂性-简单性与多样性-普适性之间转变关系;揭示了网络的拓扑结构特征与网络的动态特性之间关系;建立具有长程连接的规则网络的部分同步理论并应用于随机耦合的时空非线性系统的同步;提出复杂网络的动力学同步与控制多种方法;提出若干提高同步能力的模型、方法和途径,如同步最优和同步优先模型、同步与网络特征量关系、权重作用、叶子节点影响等;提出复杂混沌网络的多目标控制及具有小世界和无标度拓扑的束流输运网络的束晕-混沌控制方法;提出集群系统的自适应同步模型及蜂拥控制方法;探讨网络上拥塞与路由控制、资源博弈及不同类型网络上传播的若干规律;揭示含权经济科学家合作网及其演化特点;实证研究并揭示了多层次的高科技企业网和若干社会网络的特点;提出一种复杂网络的非平衡统计方法,把宏观网络推进到微观量子网络。     

基于复合符号混沌的伪随机数生成器及加密技术

提出了复合符号混沌序列的概念;并以符号动力学的揉序列为基础,将已知的伪随机数与揉序列规则下的短序列复合后得到新的符号混沌序列,再转换成二进制序列,从而得到长度随迭代次数成几何级数增加的伪随机序列(PRN).理论与实证分析都表明这是一个有效的伪随机生成器.为应用到图像的加解密技术中,建立了一个新型元胞自动机.该元胞自动机能有效地避免数据膨胀,加密效率高,并能产生显著的"雪崩效应",提高了加密技术的安全性. 关键词： 复合符号混沌序列 符号动力学 伪随机序列 元胞自动机     

基于元胞自动机的无线传感网络整体行为研究

探讨自组织通信网络中局部行为与系统整体行为的关联, 对于相关系统的设计和控制具有重要应用价值. 利用二维元胞自动机模型对无线传感网络的拓扑控制过程进行模拟, 可以分析节点间局部交互作用规则对网络整体行为的影响. 研究表明, 在不同的局部演化规则作用下, 该系统呈现出复杂的时空演化现象, 发现系统整体行为空间中存在振荡、衰减、稳定等基本模式, 并且该模型可以反映系统内不同全局目标之间的折中关系, 为进一步研究无线传感网络整体行为的控制问题提供一种新的途径. 关键词： 自组织 元胞自动机 通信网络 无线传感网络     

考虑网络流量的无标度网络病毒免疫策略研究

考虑网络交通流量对病毒传播行为的影响,基于平均场理论研究无标度网络上的病毒免疫策略,提出一种改进的熟人免疫机理.理论分析表明,在考虑网络交通流量影响的情况下,当免疫节点密度较小时,随机免疫几乎不能降低病毒的传播速率,而对网络实施目标免疫则能够有效抑制病毒的传播,并且选择度最大的节点进行免疫与选择介数最大的节点进行免疫的效果基本相同.研究还发现,对于网络全局信息未知的情况,与经典熟人免疫策略相比,所提出的免疫策略能够获得更好的免疫效果.通过数值仿真对理论分析进行了验证. 关键词： 无标度网络 病毒传播 交通流量 免疫策略     

Disease spreading on fitness-rewired complex networks

As people travel, human contact networks may change topologically from time to time. In this paper, we study the problem of epidemic spreading on this kind of dynamic network, specifically the one in which the rewiring dynamics of edges are carried out to preserve the degree of each node (called fitness rewiring). We also consider the adaptive rewiring of edges, which encourages disconnections from and discourages connections to infected nodes and eventually leads to the isolation of the infected from the susceptible with only a small number of links between them. We find that while the threshold of epidemic spreading remains unchanged and prevalence increases in the fitness rewiring dynamics, meeting of the epidemic threshold is delayed and prevalence is reduced (if adaptive dynamics are included). To understand these different behaviors, we introduce a new measure called the “mean change of effective links” and find that creation and deletion of pathways for pathogen transmission are the dominant factors in fitness and adaptive rewiring dynamics, respectively.     

Contagion dynamics on adaptive multiplex networks with awareness-dependent rewiring

Over the last few years, the interplay between contagion dynamics of social influences (e.g., human awareness, risk perception, and information dissemination) and biological infections has been extensively investigated within the framework of multiplex networks. The vast majority of existing multiplex network spreading models typically resort to heterogeneous mean-field approximation and microscopic Markov chain approaches. Such approaches usually manifest richer dynamical properties on multiplex networks than those on simplex networks; however, they fall short of a subtle analysis of the variations in connections between nodes of the network and fail to account for the adaptive behavioral changes among individuals in response to epidemic outbreaks. To transcend these limitations, in this paper we develop a highly integrated effective degree approach to modeling epidemic and awareness spreading processes on multiplex networks coupled with awareness-dependent adaptive rewiring. This approach keeps track of the number of nearest neighbors in each state of an individual; consequently, it allows for the integration of changes in local contacts into the multiplex network model. We derive a formula for the threshold condition of contagion outbreak. Also, we provide a lower bound for the threshold parameter to indicate the effect of adaptive rewiring. The threshold analysis is confirmed by extensive simulations. Our results show that awareness-dependent link rewiring plays an important role in enhancing the transmission threshold as well as lowering the epidemic prevalence. Moreover, it is revealed that intensified awareness diffusion in conjunction with enhanced link rewiring makes a greater contribution to disease prevention and control. In addition, the critical phenomenon is observed in the dependence of the epidemic threshold on the awareness diffusion rate, supporting the metacritical point previously reported in literature. This work may shed light on understanding of the interplay between epidemic dynamics and social contagion on adaptive networks.     

异质自适应网络中的核心-边缘结构及其对疾病传播的抑制作用

节点属性异质自适应网络中疾病传播的研究表明节点属性异质性可以很大程度上增大传播阈值, 并且自组织形成一个更鲁棒的度异质网络结构. 本文从数值模拟方面研究鲁棒的度分布异质结构的自组织形成过程, 分析发现核心-边缘结构的形成才是导致传播阈值增大的根本原因. 鉴于此, 提出一种重连策略, 能够促进核心-边缘结构的形成, 从而达到增大传播阈值的目的. 这不仅有助于深入认识节点属性异质自适应网络中的流行病传播过程, 而且为疾病传播控制策略的提出提供了新思路.     

Epidemic dynamics on an adaptive network

Many real-world networks are characterized by adaptive changes in their topology depending on the state of their nodes. Here we study epidemic dynamics on an adaptive network, where the susceptibles are able to avoid contact with the infected by rewiring their network connections. This gives rise to assortative degree correlation, oscillations, hysteresis, and first order transitions. We propose a low-dimensional model to describe the system and present a full local bifurcation analysis. Our results indicate that the interplay between dynamics and topology can have important consequences for the spreading of infectious diseases and related applications.     

Effect of local rewiring in adaptive epidemic networks

We investigate the dynamics of a susceptible-infected-susceptible (SIS) epidemic model on adaptive (co-evolutionary) networks. In most of these models, the rewiring mechanism is based on information known globally. Here, we propose local rewiring where rewiring decision is based on local information around a given node. Our results show that there are phase overlaps between local and global rewirings. The results suggest that under a certain circumstance, even with limited local information, outcomes from both rewirings are statistically similar. Furthermore, we found that the epidemic threshold does not depend on the amount of information. This could be useful for planned intervention of an epidemic spreading using minimal information.     

Epidemic dynamics behavior in some bus transport networks

We abstract bus transport networks (BTNs) to complex networks using the Space P approach. First, we select three actual BTNs in three major cities in China, namely, Beijing, Shanghai and Hangzhou. Using the SIS model, we simulate and study the epidemic spreading in the three BTNs. We obtain the density of infected vertices varying with time and the stationary density of infected vertices varying with infection rate. Second, we simulate and study the epidemic spreading in a recently introduced BTN evolution model, the network properties of which correspond well with those of actual BTNs. Third, we use mean-field theory to analyze the epidemic dynamics behavior of the BTN evolution model and obtain the theoretical epidemic threshold of this model. The theoretical value agrees well with the simulation results. Based on the work in this paper, we provide the following possible forecasts for epidemic dynamics in actual BTNs. An actual BTN should have a finite positive epidemic threshold. If the effective infection rate is above this threshold, the epidemic spread in the network and the density of infected vertices finally stabilizes in a balanced state. Below this threshold, the number of infected vertices decays exponentially fast and the epidemic cannot spread on a large scale.     

Adaptive random walks on the class of Web graphs

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦β_c≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.     

Epidemic propagation on adaptive coevolutionary networks with preferential local-world reconnecting strategy

In the propagation of an epidemic in a population, individuals adaptively adjust their behavior to avoid the risk of an epidemic. Differently from existing studies where new links are established randomly, a local link is established preferentially in this paper. We propose a new preferentially reconnecting edge strategy depending on spatial distance (PR- SD). For the PR-SD strategy, the new link is established at random with probability p and in a shortest distance with the probability 1 p. We establish the epidemic model on an adaptive network using Cellular Automata, and demonstrate the effectiveness of the proposed model by numerical simulations. The results show that the smaller the value of parameter p, the more difficult the epidemic spread is. The PR-SD strategy breaks long-range links and establishes as many short-range links as possible, which causes the network efficiency to decrease quickly and the propagation of the epidemic is restrained effectively.     

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

Based on the model of the same degree of all nodes we proposed before, a new algorithm, the so-called “spread all over vertices” (SAV) algorithm, is proposed for generating small-world properties from a regular ring lattices. During randomly rewiring connections the SAV is used to keep the unchanged number of links. Comparing the SAV algorithm with the Watts-Strogatz model and the “spread all over boundaries” algorithm, three methods can have the same topological properties of the small world networks. These results offer diverse formation of small world networks. It is helpful to the research of some applications for dynamics of mutual oscillator inside nodes and interacting automata associated with networks.