Spatiotemporal Characteristic of Epidemic Spreading in Mobile Individuals

We numerical simulate the propagation behaviour and people distribution trait of epidemic spreading in mobile individuals by using cellular automaton method. The simulation results show that there exists a critical value of infected rate fluctuating amplitude, above which the epidemic can spread in whole population. Moreover, with the value of infected rate fluctuating amplitude increasing, the spatial distribution of infected population exhibits the spontaneous formation of irregular spiral waves and convergence phenomena, at the same time, the density of different populations will oscillate automatically with time. What is more, the traits of dynamic grow clearly and stably when the time and the value of infected rate fluctuating amplitude increasing. It is also found that the maximal proportion of infected individuals is independent of the value of fluctuating amplitude rate, but increases linearly with the population density.     

Effects of disease characteristics and population distribution on dynamics of epidemic spreading among residential sites

We investigate the spreading processes of epidemic diseases among many residential sites for different disease characteristics and different population distributions by constructing and solving a set of integrodifferential equations for the evolutions of position-dependent infected and infective rates, taking into account the infection processes both within a single site and among different sites. In a spreading process the states of an individual include susceptible (S), incubative (I), active (A) and recovered (R) states. Although the transition from S to I mainly depends on the active rate, the susceptible rate and the connectivity among individuals, the transitions from I to A and from A to R are determined by intrinsic characteristics of disease development in individuals. We adopt incubation and infection periods to describe the intrinsic features of the disease. By numerically solving the equations we find that the asymptotic behavior of the spreading crucially depends on the infection period and the population under affection of an active individual. Other factors, such as the structure of network and the popular distribution, play less important roles. The study may provide useful information for analyzing the key parameters affecting the dynamics and the asymptotic behavior.     

Risk Estimate of Diseases in Scale-Free Networks

We investigate the effect of risk estimate on the spread of diseases by the standard susceptible-infected- susceptible （SIS） model. The perception of the risk of being infected is explained as cutting off links among individuals, either healthy or infected, We study this simple dynamics on scale-free networks by analytical methods and computer simulations. We obtain the self-consistency form for the infection prevalence in steady states. For a given transmission rate, there exists a linear relationship between the reciprocal of the density of infected nodes and the estimate parameter. We confirm all the results by sufficient numerical simulations.     

Periodic Wave of Epidemic Spreading in Community Networks

It was reported by Cummings ef al. [Nature 427 （2004） 344] that there are periodic waves in the spatiotemporal data of epidemics. For understanding the mechanism, we study the epidemic spreading on community networks by both the SIS model and the SIRS model. We find that with the increase of infection rate, the number of total infected nodes may be stabilized at a fixed point, oscillatory waves, and periodic cycles. Moreover, the epidemic spreading in the SIS model can be explained by an analytic map.     

Epidemic outbreaks in growing scale-free networks with local structure

The class of generative models has already attracted considerable interest from researchers in recent years and much expanded the original ideas described in BA model. Most of these models assume that only one node per time step joins the network. In this paper, we grow the network by adding n interconnected nodes as a local structure into the network at each time step with each new node emanating m new edges linking the node to the preexisting network by preferential attachment. This successfully generates key features observed in social networks. These include power-law degree distribution p_k∼k^−(3+μ), where μ=(n−1)/m is a tuning parameter defined as the modularity strength of the network, nontrivial clustering, assortative mixing, and modular structure. Moreover, all these features are dependent in a similar way on the parameter μ. We then study the susceptible-infected epidemics on this network with identical infectivity, and find that the initial epidemic behavior is governed by both of the infection scheme and the network structure, especially the modularity strength. The modularity of the network makes the spreading velocity much lower than that of the BA model. On the other hand, increasing the modularity strength will accelerate the propagation velocity.     

A new weighting method in network-based recommendation

In this paper, we propose a influence-based approach to investigate network-based recommendation systems. Different from the previous mass diffusion approach, we give a new expression of initial resource distribution and take into account the influence of resources associated with the receiver nodes. According to ranking score and two measures about the degree of personalization, we demonstrate that our method can outperform the previous methods greatly. It’s found that there exists an optimal initial resource distribution that leads to the best algorithmic accuracy and personalization strength. The optimal initial resource distribution indicates that we should increase the initial resource located on popular objects, rather than decrease them.     

Personal recommendation via modified collaborative filtering

In this paper, we propose a novel method to compute the similarity between congeneric nodes in bipartite networks. Different from the standard cosine similarity, we take into account the influence of a node’s degree. Substituting this new definition of similarity for the standard cosine similarity, we propose a modified collaborative filtering (MCF). Based on a benchmark database, we demonstrate the great improvement of algorithmic accuracy for both user-based MCF and object-based MCF.     

Collaborative filtering based on multi-channel diffusion

In this paper, by applying a diffusion process, we propose a new index to quantify the similarity between two users in a user-object bipartite graph. To deal with the discrete ratings on objects, we use a multi-channel representation where each object is mapped to several channels with the number of channels being equal to the number of different ratings. Each channel represents a certain rating and a user having voted an object will be connected to the channel corresponding to the rating. Diffusion process taking place on such a user-channel bipartite graph gives a new similarity measure of user pairs, which is further demonstrated to be more accurate than the classical Pearson correlation coefficient under the standard collaborative filtering framework.     

Effects of high-order correlations on personalized recommendations for bipartite networks

In this paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user-user correlations are obtained by a diffusion process. Furthermore, by considering the second-order correlations, we design an effective algorithm that depresses the influence of mainstream preferences. Simulation results show that the algorithmic accuracy, measured by the average ranking score, is further improved by 20.45% and 33.25% in the optimal cases of MovieLens and Netflix data. More importantly, the optimal value depends approximately monotonously on the sparsity of the training set. Given a real system, we could estimate the optimal parameter according to the data sparsity, which makes this algorithm easy to be applied. In addition, two significant criteria of algorithmic performance, diversity and popularity, are also taken into account. Numerical results show that as the sparsity increases, the algorithm considering the second-order correlation can outperform the MCF simultaneously in all three criteria.     

Reply to: “Comment on: ‘Epidemic spreading on heterogeneous networks with identical infectivity’ [Phys. Lett. A 364 (2007) 189]” [Phys. Lett. A 372 (2008) 1722]

In a recent Letter [R. Yang, B.H. Wang, J. Ren, W.J. Bai, Z.W. Shi, W.X. Wang, T. Zhou, Phys. Lett. A 364 (2007) 189], we proposed a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contact, A, at each time step. We found a threshold value λc=1/A in uncorrelated and unlocalized networks. A corresponding Comment, raised by Alberto d'Onofrio, claimed that (i) our model is not biologically relevant; (ii) our model does not have a threshold behavior for recovered population; (iii) the analytical result λc=1/A is incorrect being considered as a threshold for epidemic outbreak, because of an improper approximation of the initial configuration. In this Reply, I show that, by debating from point to point, our analysis and conclusion are solid and reasonable.     

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.     

Information Filtering via Improved Similarity Definition

Based on a new definition of user similarity, we introduce an improved collaborative filtering （ICF） algorithm, which couM improve the algorithmic accuracy and diversity simultaneously. In the ICF, instead of the standard Pearson coefficient, the user-user similarities are obtained by integrating the heat conduction and mass diffusion processes. The simulation results on a benchmark data set indicate that the corresponding algorithmic accuracy, measured by the ranking score, is improved by 6. 7% in the optimal case compared to the standard collaborative filtering （CF） algorithm. More importantly, the diversity of the recommendation lists is also improved by 63.6%. Since the user similarity is crucial for the CF algorithm, this work may shed some light on how to improve the algorithmic performance by giving accurate similarity measurement.     

Message Spreading and Forget--Remember Mechanism on a Scale-Free Network

We study message spreading on a scale-free network, by introducing a novel forget-remember mechanism. Message, a general term which can refer to email, news, rumor or disease, etc, can be forgotten and remembered by its holder. The way the message is forgotten and remembered is governed by the forget and remember function, F and R, respectively. Both F and R are functions of history time t concerning individual's previous states, namely being active (with message) or inactive (without message). Our systematicsimulations show at the low transmission rate whether or not the spreading can be efficient is primarily determined by the corresponding parameters for F and R.     

Immunization of susceptible-infected model on scale-free networks

In this paper, we investigate two major immunization strategies, random immunization and targeted immunization, of the susceptible-infected (SI) model on the Barabási-Albert (BA) networks. For the heterogeneous structure, the random strategy is quite ineffective if the vaccinated proportion is small, while the targeted one which prefers to vaccinate the individuals with the largest degree can sharply depress the epidemic spreading even only a tiny fraction of population are vaccinated. The analytical solution is also obtained, which can capture the trend of velocity change vs. the amount of vaccinated population.     

An Efficient Control Strategy of Epidemic Spreading on Scale-Free Networks

We present a novel and effective method for controlling epidemic spreading on complex networks, especially on scale-free networks. The proposed strategy is performed by deleting edges according to their significances （the significance of an edge is defined as the product of the degrees of two nodes of this edge）. In contrast to other methods, e.g., random immunization, proportional immunization, targeted immunization, acquaintance immunization and so on, which mainly focus on how to delete nodes to realize the control of epidemic spreading on complex networks, our method is more effective in realizing the control of epidemic spreading on complex networks, moreover, such a method can better retain the integrity of complex networks.     

Evolutionary Games on Weighted Newman-Watts Small-World Networks

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.     

Opinion Spreading with Mobility on Scale-Free Networks

A continuum opinion dynamic model is presented based on two rules. The first one considers the mobilities of the individuals, the second one supposes that the individuals update their opinions independently. The results of the model indicate that the bounded confidence εc, separating consensus and incoherent states, of a scale-free network is much smaller than the one of a lattice. If the system can reach the consensus state, the sum of all individuals＇ opinion change Oc（t） quickly decreases in an exponential form, while if it reaches the incoherent state finally, Oc（t） decreases slowly and has the punctuated equilibrium characteristic.     

Prisoner's Dilemma Game on Two Types of Positively Correlated Networks

We study the effects of degree correlations on the evolution of cooperation in the prisoner＇s dilemma game with individuals located on two types of positively correlated networks. It is shown that the positive degree correlation can either promote or inhibit the emergence of cooperation depending on network configurations. Furthermore, we investigate the probability to cooperate as a function of connectivity degree, and find that high-degree individuals generally have a higher tendency to cooperate. Finally, it is found that small-degree individuals usually change their strategy more frequently, and such change is shown to be unfavourable to cooperation for both kinds of networks.     

Prisoner's Dilemma Game on Clustered Scale-Free Networks under Different Initial Distributions

The evolutionary prisoner＇s dilemma game is investigated under different initial distributions for cooperators and defectors on scale-free networks with a tunable clustering coefficient. It is found that, on the one hand, cooperation can be enhanced with the increasing clustering coefficient when only the most connected nodes are occupied by cooperators initially. On the other hand, if cooperators just occupy the lowest-degree nodes at the beginning, then the higher the value of the clustering coefficient, the more unfavorable the environment for cooperators to survive for the increment of temptation to defect. Thereafter, we analytically argue these nontrivial phenomena by calculating the cooperation probability of the nodes with different degrees in the steady state, and obtain the critical values of initial frequency of cooperators below which cooperators would vanish finally for the two initial distributions.     

Synchronization of Coupled Oscillators on Newman-Watts Small-World Networks

We investigate the collection behaviour of coupled phase oscillators on Newman-Watts small-world networks in one and two dimensions. Each component of the network is assumed as an oscillator and each interacts with the others following the Kuramoto model We then study the onset of global synchronization of phases and frequencies based on dynamic simulations and finite-size scaling. Both the phase and frequency synchronization are observed to emerge in the presence of a tiny fraction of shortcuts and enhanced with the increases of nearest neighbours and lattice dimensions.