Dynamics and control strategies of infectious disease under different scenarios on hierarchical geographical networks

Human settlements are embedded in traffic networks with hierarchical structures. In order to understand the spreading mechanism of infectious diseases and deploy control measures, the susceptible-infected-removed spreading process is studied with agents moving globally on the hierarchical geographic network, taking into account agents’ preference for node layers and memory of initial nodes. We investigate the spreading behavior in the case of global infection under different scenarios, including different directions of human flow, different locations of infection source, and different moving behaviors of agents between layers. Based on the above-mentioned analysis, we propose screening strategies based on layer rank and moving distance, and compare their effects on delaying epidemic spreading. We find that in the case of global infection,infection spreads faster in high layers than in low layers, and early infection in high layers and moving to high layers both accelerate epidemic spreading. Travels of high-layer and low-layer residents have different effects on accelerating epidemic spreading, and moving between high and low layers increases the peak value of new infected cases more than moving in the same layer or between adjacent layers. Infection in intermediate nodes enhances the effects of moving of low-layer residents more than the moving of high-layer residents on accelerating epidemic spreading. For screening measures, improving the success rate is more effective on delaying epidemic spreading than expanding the screening range. With the same number of moves screened, screening moves into or out of high-layer nodes combined with screening moves between subnetworks has better results than only screening moves into or out of high-layer nodes, and screening long-distance moves has the worst results when the screening range is small, but it achieves the best results in reducing the peak value of new infected cases when the screening range is large enough. This study probes into the spreading process and control measures under different scenarios on the hierarchical geographical network, and is of great significance for epidemic control in the real world.

Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

We investigate cooperative behaviors of lattice-embedded scale-free networking agents in the prisoner'sdilemma game model by employing two initial strategy distribution mechanisms,which are specific distribution to themost connected sites (hubs) and random distribution.Our study indicates that the game dynamics crucially dependson the underlying spatial network structure with different strategy distribution mechanism.The cooperators' specificdistribution contributes to an enhanced level of cooperation in the system compared with random one,and cooperationis robust to cooperators' specific distribution but fragile to defectors' specific distribution.Especially,unlike the specificcase,increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism.Furthermore,we study the geographical effects and find that the graphically constrained network structure tends toimprove the evolution of cooperation in random case and in specific one for a large temptation to defect.

Recommending Personalized POIs from Location Based Social Network

Location based social networks（ LBSNs） provide location specific data generated from smart phone into online social networks thus people can share their points of interest（ POIs）. POI collections are complex and can be influenced by various factors,such as user preferences,social relationships and geographical influence. Therefore,recommending new locations in LBSNs requires to take all these factors into consideration. However,one problem is how to determine optimal weights of influencing factors in an algorithm in which these factors are combined. The user similarity can be obtained from the user check-in data,or from the user friend information,or based on the different geographical influences on each user＇s check-in activities. In this paper,we propose an algorithm that calculates the user similarity based on check-in records and social relationships,using a proposed weighting function to adjust the weights of these two kinds of similarities based on the geographical distance between users. In addition,a non-parametric density estimation method is applied to predict the unique geographical influence on each user by getting the density probability plot of the distance between every pair of user＇s check-in locations. Experimental results,using foursquare datasets,have shown that comparisons between the proposed algorithm and the other five baseline recommendation algorithms in LBSNs demonstrate that our proposed algorithm is superior in accuracy and recall,furthermore solving the sparsity problem.

Exploiting Geo-Social Correlations to Improve Pairwise Ranking for Point-of-Interest Recommendation

Recently, as location-based social network(LBSN) rapidly grow, point-of-interest(POI) recommendation has become an important way to help people locate interesting places. Nowadays, there have been deep studies conducted on the geographical and social influence in the point-of-interest recommendation model based on the rating prediction. The fact is, however, relying solely on the rating fails to reflect the user's preferences very accurately, because the users are most concerned with the list of ranked point-of-interests(POIs) on the actual output of recommender systems. In this paper, we propose a co-pairwise ranking model called Geo-Social Bayesian Personalized Ranking model(GSBPR), which is based on the pairwise ranking with the exploiting geo-social correlations by incorporating the method of ranking learning into the process of POI recommendation. In this model, we develop a novel BPR pairwise ranking assumption by injecting users' geo-social preference. Based on this assumption, the POI recommendation model is reformulated by a three-level joint pairwise ranking model. And the experimental results based on real datasets show that the proposed method in this paper enjoys better recommendation performance compared to other state-of-the-art POI recommendation models.

Textual-geographical-social aware point-of-interest recommendation

The rapid development of location-based social networks（LBSNs） has provided an unprecedented opportunity for better location-based services through point-of-interest（POI） recommendation. POI recommendation is personalized, location-aware, and context depended. However, extreme sparsity of user-POI matrix creates a severe challenge. In this paper we propose a textual-geographical-social aware probabilistic matrix factorization method for POI recommendation. Our model is textual-geographical-social aware probabilistic matrix factorization called TGS-PMF, it exploits textual information, geographical information, social information, and incorporates these factors effectively. First, we exploit an aggregated latent Dirichlet allocation（LDA） model to learn the interest topics of users and infer the interest POIs by mining textual information associated with POIs and generate interest relevance score. Second, we propose a kernel estimation method with an adaptive bandwidth to model the geographical correlations and generate geographical relevance score. Third, we build social relevance through the power-law distribution of user social relations to generate social relevance score. Then, our exploit probabilistic matrix factorization model（PMF） to integrate the interest, geographical, social relevance scores for POI recommendation. Finally, we implement experiments on a real LBSN check-in dataset. Experimental results show that TGS-PMF achieves significantly superior recommendation quality compared to other state-of-the-art POI recommendation techniques.