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.     

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.     

Rewiring dynamical networks with prescribed degree distribution for enhancing synchronizability

In this paper, we present an algorithm for enhancing synchronizability of dynamical networks with prescribed degree distribution. The algorithm takes an unweighted and undirected network as input and outputs a network with the same node-degree distribution and enhanced synchronization properties. The rewirings are based on the properties of the Laplacian of the connection graph, i.e., the eigenvectors corresponding to the second smallest and the largest eigenvalues of the Laplacian. A term proportional to the eigenvectors is adopted to choose potential edges for rewiring, provided that the node-degree distribution is preserved. The algorithm can be implemented on networks of any sizes as long as their eigenvalues and eigenvectors can be calculated with standard algorithms. The effectiveness of the proposed algorithm in enhancing the network synchronizability is revealed by numerical simulation on a number of sample networks including scale-free, Watts-Strogatz, and Erdo?s-Re?nyi graphs. Furthermore, a number of network's structural parameters such as node betweenness centrality, edge betweenness centrality, average path length, clustering coefficient, and degree assortativity are tracked as a function of optimization steps.     

Enhancing synchronizability by rewiring networks

<正>According to different forms of synchronized region,complex networks are divided into typeⅠ(unbounded synchronization region) and typeⅡ(bounded synchronization region) networks.This paper presents a rewiring algorithm to enhance the synchronizability of typeⅠand typeⅡnetworks.By utilizing the algorithm for an unweighted and undirected network,a better synchronizability of network with the same number of nodes and edges can be obtained. Numerical simulations on several different network models are used to support the proposed procedure.The relationship between different topological properties of the networks and the number of rewirings are shown.It finds that the final optimized network is independent of the initial network,and becomes homogeneous.In addition the optimized networks have similar structural properties in the sense of degree,and node and edge betweenness centralities.However,they do not have similar cluster coefficients for typeⅡnetworks.The research may be useful for designing more synchronizable networks and understanding the synchronization behaviour of 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.     

Shift of percolation thresholds for epidemic spread between static and dynamic small-world networks

The study compares the epidemic spread on static and dynamic small-world networks. They are constructed as a 2-dimensional Newman and Watts model (500 × 500 square lattice with additional shortcuts), where the dynamics involves rewiring shortcuts in every time step of the epidemic spread. We assume susceptible-infectious-removed (SIR) model of the disease. We study the behaviour of the epidemic over the range of shortcut probability per underlying bond ϕ = 0–0.5. We calculate percolation thresholds for the epidemic outbreak, for which numerical results are checked against an approximate analytical model. We find a significant lowering of percolation thresholds on the dynamic network in the parameter range given. The result shows the behaviour of the epidemic on dynamic network is that of a static small world with the number of shortcuts increased by 20.7±1.4 %, while the overall qualitative behaviour stays the same. We derive corrections to the analytical model which account for the effect. For both dynamic and static small worlds we observe suppression of the average epidemic size dependence on network size in comparison with the finite-size scaling known for regular lattice. We also study the effect of dynamics for several rewiring rates relative to infectious period of the disease.     

一种基于元胞自动机的自适应网络病毒传播模型

自适应网络是节点动力学和网络动力学相互作用和反馈的演化网络. 基于元胞自动机建立自适应网络中易感-感染-易感(susceptible-infected-susceptible)的病毒传播模型,研究节点为了规避病毒传播所采取的多种网络重连规则对病毒传播及网络统计特征的影响. 结果表明:自适应网络中的重连规则可以有效减缓病毒传播速度,降低病毒传播规模;随机重连规则使得网络统计特征趋于随机网络;基于元胞自动机建立的传播模型清晰地表达了病毒在传播过程中的双稳态现象. 关键词： 自适应网络 传播动力学 网络动力学 元胞自动机     

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

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

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.     

LCH: A local clustering H-index centrality measure for identifying and ranking influential nodes in complex networks

Identifying influential nodes in complex networks is one of the most significant and challenging issues, which may contribute to optimizing the network structure, controlling the process of epidemic spreading and accelerating information diffusion. The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity. Moreover, they do not take into account the impact of network topology evolution over time, resulting in limitations in some applications. Based on local information of networks, a local clustering H-index (LCH) centrality measure is proposed, which considers neighborhood topology, the quantity and quality of neighbor nodes simultaneously. The proposed measure only needs the information of first-order and second-order neighbor nodes of networks, thus it has nearly linear time complexity and can be applicable to large-scale networks. In order to test the proposed measure, we adopt the susceptible-infected-recovered (SIR) and susceptible-infected (SI) models to simulate the spreading process. A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.     

Randomness Effect on Cooperation in Memory-Based Snowdrift Game

A memory-based snowdrift game (MBSG) on spatial small-world networks is investigated. It is found that cooperation rate versus temptation shows some step structures on small-world networks, similar to the case on regular lattices. With the increment of rewiring probability based on four-neighbourregular lattices, more steps are observable. Interestingly, it is observed that cooperation rate peaks at a specific value of temptation, which indicates that properly encouraging selfish actions may lead to better cooperative behaviours in the MBSG on small-world networks. Memory effects are also discussed for different rewiring probabilities. Furthermore, optimal regions arefound in the parameter planes. The strategy-related average degrees of individuals are helpful to understand the obtained results.     

Epidemic spreading on random surfer networks with infected avoidance strategy

In this paper, we study epidemic spreading on random surfer networks with infected avoidance(IA) strategy. In particular, we consider that susceptible individuals' moving direction angles are affected by the current location information received from infected individuals through a directed information network. The model is mainly analyzed by discrete-time numerical simulations. The results indicate that the IA strategy can restrain epidemic spreading effectively. However,when long-distance jumps of individuals exist, the IA strategy's effectiveness on restraining epidemic spreading is heavily reduced. Finally, it is found that the influence of the noises from information transferring process on epidemic spreading is indistinctive.     

Comparison of immunization strategies in geographical networks

The epidemic spread and immunizations in geographically embedded scale-free (SF) and Watts-Strogatz (WS) networks are numerically investigated. We make a realistic assumption that it takes time which we call the detection time, for a vertex to be identified as infected, and implement two different immunization strategies: one is based on connection neighbors (CN) of the infected vertex with the exact information of the network structure utilized and the other is based on spatial neighbors (SN) with only geographical distances taken into account. We find that the decrease of the detection time is crucial for a successful immunization in general. Simulation results show that for both SF networks and WS networks, the SN strategy always performs better than the CN strategy, especially for more heterogeneous SF networks at long detection time. The observation is verified by checking the number of the infected nodes being immunized. We found that in geographical space, the distance preferences in the network construction process and the geographically decaying infection rate are key factors that make the SN immunization strategy outperforms the CN strategy. It indicates that even in the absence of the full knowledge of network connectivity we can still stop the epidemic spread efficiently only by using geographical information as in the SN strategy, which may have potential applications for preventing the real epidemic spread.     

Immunization for scale-free networks by random walker

Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that these strategies can lead to the eradication of the epidemic by immunizing a small fraction of the nodes in the networks. Particularly, the immunization strategy based on the intentional random walk is extremely efficient for the assortatively mixed networks.     

Influence of assortativity and degree-preserving rewiring on the spectra of networks

Newman’s measure for (dis)assortativity, the linear degree correlation coefficient $\rho _{D}$ , is reformulated in terms of the total number N _k of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases $\rho _{D}$ conform our desired objective. Spectral metrics (eigenvalues of graph-related matrices), especially, the largest eigenvalue $\lambda _{1}$ of the adjacency matrix and the algebraic connectivity $\mu _{N-1}$ (second-smallest eigenvalue of the Laplacian) are powerful characterizers of dynamic processes on networks such as virus spreading and synchronization processes. We present various lower bounds for the largest eigenvalue $\lambda _{1}$ of the adjacency matrix and we show, apart from some classes of graphs such as regular graphs or bipartite graphs, that the lower bounds for $\lambda _{1}$ increase with $\rho _{D}$ . A new upper bound for the algebraic connectivity $\mu _{N-1}$ decreases with $\rho _{D}$ . Applying the degree-preserving rewiring algorithm to various real-world networks illustrates that (a) assortative degree-preserving rewiring increases $\lambda _{1}$ , but decreases $\mu _{N-1}$ , even leading to disconnectivity of the networks in many disjoint clusters and that (b) disassortative degree-preserving rewiring decreases $\lambda _{1}$ , but increases the algebraic connectivity, at least in the initial rewirings.     

The multi-agent Parrondo’s model based on the network evolution

A multi-agent Parrondo’s model is proposed in the paper. The model includes link A based on the rewiring mechanism (the network evolution) + game B (dependent on the spatial neighbors). Moreover, to produce the paradoxical effect and analyze the “agitating” effect of the network evolution, the dynamic processes of the network evolution + game B are studied. The simulation results and the theoretical analysis both show that the network evolution can make game B which is losing produce the winning paradoxical effect. Furthermore, we obtain the parameter space where the strong or weak Parrondo’s paradox occurs. Each size of the region of the parameter space is larger than the one in the available multi-agent Parrondo’s model of game A + game B. This result shows that the “agitating” effect of rewiring based on the network evolution is better than that of the zero-sum game between individuals.     

Network evolution by different rewiring schemes

Many real world networks, such as social networks, are characterized by rearrangements of the links between nodes (rewiring). Indeed, very few natural networks are static in time, and it is therefore important to study the properties of networks in which rewiring occurs. In this paper, two different rewiring schemes are formulated and compared using a general ordinary differential equation (ODE) model. The equilibrium distributions are analytically derived. It is found that by uniformly choosing a node and a link connected to it, rewiring from different ends of the link yields different equilibrium degree distributions. Rewiring from the neighbor generally produces more high degree nodes. The equilibrium distributions of the ODE model are compared with simulation results of the corresponding stochastic process for rewiring. Conditions are discussed under which our ODE provides a good approximation for the mean of the corresponding stochastic process.     

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

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

Adaptive mechanism between dynamical synchronization and epidemic behavior on complex networks

Many realistic epidemic networks display statistically synchronous behavior which we will refer to as epidemic synchronization. However, to the best of our knowledge, there has been no theoretical study of epidemic synchronization. In fact, in many cases, synchronization and epidemic behavior can arise simultaneously and interplay adaptively. In this paper, we first construct mathematical models of epidemic synchronization, based on traditional dynamical models on complex networks, by applying the adaptive mechanisms observed in real networks. Then, we study the relationship between the epidemic rate and synchronization stability of these models and, in particular, obtain the conditions of local and global stability for epidemic synchronization. Finally, we perform numerical analysis to verify our theoretical results. This work is the first to draw a theoretical bridge between epidemic transmission and synchronization dynamics and will be beneficial to the study of control and the analysis of the epidemics on complex networks.     

Identification of unstable individuals in dynamic networks

To identify the unstable individuals of networks is of great importance for information mining and security management. Exploring a broad range of steady-state dynamical processes including biochemical dynamics, epidemic processes,birth–death processes and regulatory dynamics, we propose a new index from the microscopic perspective to measure the stability of network nodes based on the local correlation matrix. The proposed index describes the stability of each node based on the activity change of the node after its neighbor is disturbed. Simulation and comparison results show our index can identify the most unstable nodes in the network with various dynamical behaviors, which would actually create a richer way and a novel insight of exploring the problem of network controlling and optimization.