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.     

基于移动社交网络的谣言传播动力学研究

本文在CSR传播模型的基础上提出基于移动社交网络的CSR的谣言传播模型. 改进了CSR模型的传播规则和传播动力学方程, 使得更符合移动SNS上用户的使用习惯. 在CSR模型中的接受概率数学模型基础上, 考虑个人接受阈值对接受概率的影响, 更符合人类接受谣言的心理学特点. 本文对该传播模型进行了理论分析. 并在仿真实验中, 利用多agent仿真平台对新模型和CSR模型以及SIR模型 在匀质网络和异质网络中的传播效果进行了对比研究, 从实验的结果来看, 新的谣言传播模型在匀质网络中传播范围更广, 传播速度更快. 新模型具有初值敏感性的特点. 关键词： 复杂网络 移动社交网络 谣言传播     

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

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

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

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

Correlation and trust mechanism-based rumor propagation model in complex social networks

In real life, the rumor propagation is influenced by many factors. The complexity and uncertainty of human psychology make the diffusion model more challenging to depict. In order to establish a comprehensive propagation model, in this paper, we take some psychological factors into consideration to mirror rumor propagation. Firstly, we use the Ridenour model to combine the trust mechanism with the correlation mechanism and propose a modified rumor propagation model. Secondly, the mean-field equations which describe the dynamics of the modified SIR model on homogenous and heterogeneous networks are derived. Thirdly, a steady-state analysis is conducted for the spreading threshold and the final rumor size. Fourthly, we investigate rumor immunization strategies and obtain immunization thresholds. Next, simulations on different networks are carried out to verify the theoretical results and the effectiveness of the immunization strategies. The results indicate that the utilization of trust and correlation mechanisms leads to a larger final rumor size and a smaller terminal time. Moreover, different immunization strategies have disparate effectiveness in rumor propagation.     

Dynamics of a stochastic rumor propagation model incorporating media coverage and driven by Lévy noise

With the development of information technology, rumors propagate faster and more widely than in the past. In this paper, a stochastic rumor propagation model incorporating media coverage and driven by Lévy noise is proposed. The global positivity of the solution process is proved, and further the basic reproductive number R₀ is obtained. When R₀ < 1, the dynamical process of system with Lévy jump tends to the rumor-free equilibrium point of the deterministic system, and the rumor tends to extinction; when R₀ > 1, the rumor will keep spreading and the system will oscillate randomly near the rumor equilibrium point of the deterministic system. The results show that the oscillation amplitude is related to the disturbance of the system. In addition, increasing media coverage can effectively reduce the final spread of rumors. Finally, the above results are verified by numerical simulation.     

Epidemic spreading in complex networks

The study of epidemic spreading in complex networks is currently a hot topic and a large body of results have been achieved. In this paper, we briefly review our contributions to this field, which includes the underlying mechanism of rumor propagation, the epidemic spreading in community networks, the influence of varying topology, and the influence of mobility of agents. Also, some future directions are pointed out.      

Dynamics and near-optimal control in a stochastic rumor propagation model incorporating media coverage and Lévy noise

The appearance of rumors intensifies people's panic and affects social stability. How to control the spread of rumors has become an important issue which is worth studying. In order to more accurately reflect the actual situation in the real world, a stochastic model incorporating media coverage and Lévy noise is proposed to describe the dynamic process of rumor propagation. By introducing two control strategies of popular science education and media coverage in an emergency event, an near-optimal control problem that minimizes the influence and control cost of rumor propagation is proposed. Sufficient conditions for near-optimal control of the model are established by using a Hamiltonian function. Then the necessary conditions for near-optimal control are obtained by using the Pontryagin maximum principle. Finally, the effect of popular science education, media coverage and Lévy noise on rumor propagation process control is verified by numerical simulation.     

二元随机网

在二分网的基础上明确提出了二元网的概念：同样包含两类节点,二分网同类节点之间没有连接,而二元网同类节点之间可以有连接.构建了一个二元随机网模型,并对二元随机网的结构性质进行研究.二元随机网可以具有小世界效应,并且其平均最短路径长度比单元随机网还要小.另外,两类节点的规模比是一个重要参量,会对网络的结构性质产生重大影响. 关键词： 复杂网络 二分网 二元网 小世界     

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.     

新节点的边对网络无标度性影响

分析新节点边对网络无标度性的影响.虽然亚线性增长网络瞬态平均度分布尾部表现出了幂律分布性质,但是,这个网络的稳态度分布并不是幂律分布,由此可见,计算机模拟预测不出网络稳态度分布,它只能预测网络的瞬态度分布.进而建立随机增长网络模型,利用随机过程理论得到了这个模型的度分布的解析表达式,结果表明这个网络是无标度网络. 关键词： 复杂网络 无标度网络 小世界网络 度分布     

新节点的边对网络无标度性影响

分析新节点边对网络无标度性的影响.虽然亚线性增长网络瞬态平均度分布尾部表现出了幂律分布性质，但是，这个网络的稳态度分布并不是幂律分布，由此可见，计算机模拟预测不出网络稳态度分布，它只能预测网络的瞬态度分布.进而建立随机增长网络模型，利用随机过程理论得到了这个模型的度分布的解析表达式，结果表明这个网络是无标度网络.     

Modeling mobile ad hoc communication networks on two-dimensional square lattice

In this paper, we model the mobile ad hoc communication network on a two-dimensional square lattice. Both structure and function of it depend on transmission range and site-occupancy of nodes. Critical occupancies σ_c for different transmission ranges r to maintain global connection are found. Universal scaling function behaves as η~f(R^βσ), where R=(r−r₀)/r₀, and the scaling exponent β=−0.61, which distinguishes itself from percolation in previous lattice or network models. When the occupancy σ is near the threshold σ_c, individual nodes self-organize into a dynamic small world network relative to geometric distance. The network has a cut-off degree below which clustering coefficient keeps constant, which distinguish itself from other systems and has its potential application in technical designs.     

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.     

Successive lag synchronization on dynamical networks with communication delay

In this paper, successive lag synchronization(SLS) on a dynamical network with communication delay is investigated.In order to achieve SLS on the dynamical network with communication delay, we design linear feedback control and adaptive control, respectively. By using the Lyapunov function method, we obtain some sufficient conditions for global stability of SLS. To verify these results, some numerical examples are further presented. This work may find potential applications in consensus of multi-agent systems.     

小世界网络与无标度网络的社区结构研究

模块性(modularity)是度量网络社区结构(community structure)的主要参数.探讨了Watts和Strogatz的小世界网络(简称W-S模型)以及Barabàsi 等的B-A无标度网络(简称B-A模型)两类典型复杂网络模块性特点.结果显示，网络模块性受到网络连接稀疏的影响，W-S模型具有显著的社区结构，而B-A模型的社区结构特征不明显.因此，应用中应该分别讨论网络的小世界现象和无标度特性.社区结构不同于小世界现象和无标度特性，并可以利用模块性区别网络类型，因此网络复杂性指标应该包括 关键词： 模块性 社区结构 小世界网络 无标度网络     

网络"建筑学"

复杂网络系统普遍地存在于自然界与人类社会中，对它们的研究也具有广泛而重要的意义．我们如何来认识和区分晶格、Internet和一个生态食物链?它们又是如何演化的?在这些网络背后，是否隐藏着某种无形的组织原理?近年来，借助强大的计算工具，人们对网络的认识发生了巨大的改变，文章以小世界、集团化和无标度等新的概念为中心，介绍了其中的研究进展．     

小世界网络上的扩散限制的聚集-湮没反应动力学

通过Monte-Carlo模拟,研究了基于NW网络的两种类集团不可逆聚集-湮没过程的动力学行为.在系统中,两个同种类集团相遇,将不可逆地聚集成一个更大的集团;不同种类的两个集团相遇,则发生部分湮没反应.模拟结果表明,1)当捷径量化参数p相对较大或较小时,系统经较长时间演化后,集团密度c(t)和粒子密度g(t)呈现幂律形式,c(t)∝t^－α和g(t)∝t^－β,其中幂指数α和β满足α=2β的关系;2)当p为其他值时,集团密度和粒子密度随时间按非严格的幂 关键词： 聚集-湮没过程 小世界网络 反应动力学 Monte-Carlo模拟')" href="#">Monte-Carlo模拟     

An effective method to improve the robustness of small-world networks under attack

In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network.Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario.     

高速空间激光通信系统在空天信息网中的应用

 针对高速空间激光通信系统应用时面临的主要问题：节点高速运动的跟踪瞄准和与组网载荷协同工作,提出将高速空间激光通信系统作为节点主要通信载荷的双通信载荷结构,并设计了高速空间激光通信系统与组网载荷协同工作机制和协议模型,依据协议模型进行了原理样机开发与试验。试验结果表明,提出的协同工作机制与协议模型能很好地适用于高速空间激光系统,支持超高速率数据传输,最高MAC层协议数据速率可达1.772 Gb/s,平均处理时延20 μs。