Modeling geo-homopholy in online social networks for population distribution projection

Yuanxing Zhang (EECS, Peking University, Beijing, China)
Zhuqi Li (Department of Computer Science, Princeton University, Princeton, New Jersey, USA)
Kaigui Bian (School of Electronics Engineering and Computer Science, Peking University, Beijing, China)
Yichong Bai (Shenzhen Maxwell Data Tech Inc, Ltd, Shenzhen, China)
Zhi Yang (School of Electronics Engineering and Computer Science, Peking University, Beijing, China)
Xiaoming Li (School of Electronics Engineering and Computer Science, Peking University, Beijing, China)

International Journal of Crowd Science

ISSN: 2398-7294

Article publication date: 4 September 2017

897

Abstract

Purpose

Projecting the population distribution in geographical regions is important for many applications such as launching marketing campaigns or enhancing the public safety in certain densely populated areas. Conventional studies require the collection of people’s trajectory data through offline means, which is limited in terms of cost and data availability. The wide use of online social network (OSN) apps over smartphones has provided the opportunities of devising a lightweight approach of conducting the study using the online data of smartphone apps. This paper aims to reveal the relationship between the online social networks and the offline communities, as well as to project the population distribution by modeling geo-homophily in the online social networks.

Design/methodology/approach

In this paper, the authors propose the concept of geo-homophily in OSNs to determine how much the data of an OSN can help project the population distribution in a given division of geographical regions. Specifically, the authors establish a three-layered theoretic framework that first maps the online message diffusion among friends in the OSN to the offline population distribution over a given division of regions via a Dirichlet process and then projects the floating population across the regions.

Findings

By experiments over large-scale OSN data sets, the authors show that the proposed prediction models have a high prediction accuracy in characterizing the process of how the population distribution forms and how the floating population changes over time.

Originality/value

This paper tries to project population distribution by modeling geo-homophily in OSNs.

Keywords

Citation

Zhang, Y., Li, Z., Bian, K., Bai, Y., Yang, Z. and Li, X. (2017), "Modeling geo-homopholy in online social networks for population distribution projection", International Journal of Crowd Science, Vol. 1 No. 3, pp. 249-269. https://doi.org/10.1108/IJCS-08-2017-0008

Publisher

:

Emerald Publishing Limited

Copyright © 2017, ©Yuanxing Zhang, Zhuqi Li, Kaigui Bian, Yichong Bai, Zhi Yang and Xiaoming Li.

License

Published in the International Journal of Crowd Science. Published by Emerald Publishing Limited. This article is published under the Creative Commons Attribution (CC BY 4.0) licence. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this licence may be seen at http://creativecommons.org/licences/by/4.0/legalcode


1. Introduction

The study of population distribution in fixed geographical regions (e.g. states, provinces) is of paramount importance for the government to enhance the public safety in certain places with a large floating population (FP) or for the business to launch marketing campaigns in densely populated areas (Harris and Todaro, 1970). The data relevant to people’s trajectory are conventionally collected through offline sources. For instance, it is feasible to predict the FP in the transportation systems by analyzing the origin-destination data of passengers (Chi, 2010); Customers’ bank notes can be used for modeling the human trajectories as a continuous-time random walk (Gonzalez et al., 2008). The government (e.g. statistical bureau) collects the demographic data to investigate the correlation between human migration patterns and geographic labor demand and supply (National Bureau of Statistics of China, 2010). The challenges of conducting these studies are attributed to the high cost of the data collection methods (regarding time, manpower and money), and the restriction of accessing such data sets due to security and privacy concerns.

The wide use of online social network (OSN) apps over smartphones has accumulated a rich set of geographical data that describe anonymous user trajectories (Kido et al., 2005) and habits (Gao et al., 2017) in the physical world, which holds the promise of providing a lightweight means to study the population distribution (Li et al., 2016). For example, many OSN applications, such as Facebook, Weibo, allow users to “check-in” and explicitly show their locations (Guo et al., 2013; Nazir et al., 2008; Liao et al., 2015); some other applications have implicitly recorded users’ geo-related information such as GPS coordinates, IP address (Backstrom et al., 2010; Zheng et al., 2010). Existing research has shown the feasibility of using the OSN data to predict users’ offline locations as well their mobility patterns (Cho et al., 2011; Li et al., 2010). Moreover, the online relationship between friends can affect their social ties in the physical world (Zheng, 2012): the “close” friends in the OSN are also physically close to each other (Cho et al., 2011).

However, it is still unclear that which type of OSNs can assist determining the population distribution in given geographical regions. Intuitively, there are two observations:

  1. It is easy to draw a population distribution over geographical regions that are stable – most people in a region do not travel distantly; and

  2. Acquaintances in the same geographical region have a strong desire to communicate with each other through the OSN (Girvan and Newman, 2002).

Therefore, we seek to answer the following questions in this study:

  • Is there a way of measuring the stability of geographical regions by observing the online message diffusion among people in those regions?

  • How to derive the offline population distribution over a stable division of regions?

  • Given a population distribution, how to project the FP across regions?

Our research findings indicate that a division of geographical regions is stable only if the OSN users in these divided regions show a strong geo-homophily; people in each region prefer communicating with others in the same region more than those in other regions, and the Dirichlet process (DP) (Neal, 2000) provides a viable way of modeling the distribution of OSN users across offline regions. These inspire us to investigate the relationship between the online information diffusion, i.e. users’ communication in OSN, and the population distribution over a fixed division of offline regions.

In this paper, we present a systematic approach that projects the offline population distribution in fixed geographical regions by modeling the geo-homophily of OSNs. Specifically, we establish a three-layered theoretic framework that first maps the online message diffusion among friends in the OSN to the offline population distribution via a DP and then projects the FP across geographical regions given the derived population distribution. The contributions of this work are summarized as follows:

  • Connecting online data to stability of geographical regions: We establish the correlation between online message diffusion and the stability of geographical regions by modeling the geo-homophily of an OSN with geographical attributes. We derive the condition for a division of geographical regions to have a non-decreasing stability.

  • DP-based prediction models: We formulate the population distribution problem from the perspective of DP and present a theoretical framework to project the population distribution over fixed geographical regions by casting online message diffusion into the established framework. Based on the derived population distribution, we propose a prediction model that utilizes the message diffusion graph in OSNs to infer the FP across geographical regions.

  • Experiments using large real-world data sets: By experiments over the real-world data sets, we validate the efficacy of the model in projecting the population distribution over fixed regions and meanwhile show that the proposed prediction models have a high prediction accuracy in characterizing the process of how the FP changes across regions upon the occurrence of societal events (the mass human migration caused by the Chinese Spring Festival 2016).

The rest of this paper is organized as follows. We introduce the related work and technical background on DP in Section 2. We provide the system model and formulate the problem in Section 3. In Sections 4 and 5, we show the approach of projecting the population distribution and present the model of predicting the FP, respectively. We validate the proposed model by experiments in Section 6, and conclude the paper in Section 7.

2. Related work

2.1 Geographical views of online social networks

Prior work on geographical aspects of OSNs has mostly focused on prediction and analytics of various properties in OSN by leveraging the location-related information.

2.1.1 Predicting mobility patterns using online social network data.

Users’ locations can be predicted by mining their periodic behaviors in social network, given that the observed movement is associated with certain reference locations (Li et al., 2010). Cho et al. (2011) show that human movement and mobility patterns have a high degree of freedom and variation, but they can still exhibit structural patterns due to geographical and social constraints, on basis of two observations:

  1. short-ranged travel is periodic both spatially and temporally and not effected by the social network structure; and

  2. long-distance travel is more influenced by social network ties.

Thus, the historic data can be used to predict where a user might travel.

2.1.2 Data dissemination in a geographical perspective.

Wang et al. (2014) pose a three-layered architecture to model the data dissemination in OSNs, present a density function of general social relationship distribution and derive the tight lower bounds on traffic load of data dissemination in the OSNs under the assumption that every source sustains a data generating rate of a constant order.

2.1.3 Online and offline social behaviors.

Zheng (2012) propose a location-based social network (LBSN), which consists of the new social structure made up of individuals connected by the “interdependency” derived from their locations in the physical world as well as their location-tagged media content, such as photos, video and texts. Hristova et al. (2014) experimentalized on a data set with 74 college students as volunteers by observing evidence of homophily with regard to many factors within the online and offline social networks. They found that the social tie among students at the same educational institution was strongly affected by residential sector and year in college, but it exhibited diversity in other online aspects, leading to the affirmation saying diversity online is relative to diversity offline.

2.1.4 Social tie inference.

Sociological phenomena can be also observed within OSNs. Although the OSN platform has facilitated people’s communication, the volume of OSN communications between OSN friends (the strength of the social tie between them) is inversely proportional to the geographical distance, following a Power Law (Goldenberg and Levy, 2009). Considering the co-occurrence in time and space (Crandall et al., 2010), Crandall et al. (2010) present a probabilistic model to prove that even a very small number of co-occurrences can result in a high empirical likelihood that the two people know each other – a social tie between them, which tells us a way to infer the social network structure only by capturing individual physical location over time.

2.2 Dirichlet distribution and Dirichlet process

Dirichlet distribution is the conjugate prior of multinomial distribution, which can be seen as a distribution over distribution. The probability density function is written as:

p = ( P = { p i } | α i ) = i Γ ( α i ) Γ ( i α i ) i p i α i 1 .

There are two parameters:

  1. The scale α=iαi: a small scale α favors extreme distributions, but this prior belief is very weak and is easily overwritten by data, whereas an extremely large α makes the samples be more consistent with the base measure.

  2. The base measure (α1,α2,…),αi = αi/α: The base measure determines the mean distribution.

One popular application of Dirichlet distribution is latent Dirichlet allocation on topic discovery in natural language processing. It is a generative statistical model aiming at describing sets of observations by connotative groups why some parts of the data are similar.

DP is a class of Bayesian nonparametric models, and DP generalizes Dirichlet distribution (Neal, 2000). DP is a distribution function in a space of infinite but countable number of elements, which also requires a scale parameter α and a base measure G0, denoted as DP(α, G0). DP is an important method in Bayesian inference to identify the prior distribution of random variables, and it is widely used for density estimation, semiparametric modeling and sidestepping model selection/averaging. One important implication is that DP helps find the number of active components which is much less than the number of samples. In this paper, we investigate how to use DP to model the process that OSN users are distributed into geographical regions.

3. System model

In this section, we propose a three-layer framework that analyzes the message diffusions in the OSN to determine the stability of geographical regions. This problem is equivalent to the determination of whether the OSN has a strong geo-homophily – more specifically, whether the structure of the message diffusion graph is similar to that of the divided regions. We extend the concept of modularity (Newman, 2004) to quantify the degree of the geo-homophily of an OSN, and meanwhile we specify the condition on the geo-homophily of an OSN for the stability of underlying geographical regions to remain non-decreasing.

In Figure 1, we show a three-layered framework consisting of: Layer 1 that captures the message diffusion graph in an OSN; Layer 2 that seeks to derive the user population distribution from the geo-location of OSN users in Layer 1; and Layer 3 that predicts how the FP will change given the distribution derived in Layer 2.

From the top to the bottom layer, we first investigate how the messages diffuse among groups of people that have similar geo-locations. If people in the same geo region communicate frequently, it is highly likely that the structure of the message diffusion graph is similar to that of the underlying division of regions – the strong geo-homophily exists between the OSN and the offline regions. As a result, we can use the geo-location of messages among OSN users to derive the user distribution over the given regions. Then, the FP across regions can be further inferred based on the derived distribution.

3.1 Geo-homophily of an online social network over divided regions

We define the geo-homophily of an OSN as the degree of similarity between the structure of the message diffusion graph in the OSN and that of a given division of regions.

We calculate modularity to quantify the geo-homophily of an OSN. Given the message diffusion graph of an OSN G = (V, R, E, T), where V denotes the set of users, R denotes the set (or division) of regions and E denotes the set of edges euv with weights ρuvT. The weight ρuvT represents the number of views from user u to the content sharing by user v during time period T. The euv exists if the number of views from user u to the content sharing by user v during time period T is non-zero. Let ΩT be u,vρuvT. Each user uV belongs to a specific region rR given the division R, denoted as ru.

We can easily transform E from a user-to-user perspective to a region-to-region one, recorded as ε, where ∀ϵij ∈ℰ has value:

ωijT=uV,ru=ivV,rv=jρuvT
which represents the number of views from nodes in region i to the content of nodes in region j during time period T.

Let pijT be the proportion of messages from i to j during T, namely, ωijT/i,jωijT. To quantify the geo-homophily of an OSN G = (V, R, E, T), we define the modularity on R during T, QRT, as:

(1) QRT=iR(piiTjRpijTjRpjiT)

It reflects the centrality of messages that are transmitted within same regions. Apparently, QRT ranges in [−1, 1], where QRT reaches 1 if all diffusions take place inside the same regions and reaches −1 when none of the messages are transmitted between users from same regions. The greater QRT is, the higher geo-homophily the OSN has.

If an OSN shows a strong geo-homophily over the divided regions, most OSN users have more preference of communicating with others in the same region rather than with those in other regions, which implies each user is more attached/attracted by his current region instead of other regions, thereby leading to a high stability of each region. Next, we will show how to determine the change of the stability of a division R by imposing a condition over QRT.

3.2 Stability of a division of regions

The modularity quantifies the geo-homophily between an OSN and the underlying geographical regions. However, it is infeasible to foresee whether the regions will remain stable because the structure of the message diffusion graph is dynamically changing. For instance, a breaking news may reform the structure of the message diffusion graph and push people to move across regions, which may make the stability of the divisions vulnerable. Next, we will deduce: under what condition, the stability of a division of regions will remain non-decreasing.

Formally, given two time periods T = [t0, t1] and T = [t0, t2], where t2 > t1, we need to find the distribution of messages in period [t1, t2] that leads to an equal or higher modularity in at the end of T, i.e.QRTQRT.

We define the social-entropy of message diffusion inside and outside regions in the message diffusion graph G as:

(2) H(G)=iRjRpijT×logpijT

As the redistribution of message diffusion inside each region do not affect the modularity according to equation (1), we will only focus on those message diffusions (edges) across regions.

Hence, we combine all edges within a region into a new set. Let IT=iRϵiiT, and ωIT=iRωiiT,pIT=ωIT/ΩT. H(G) can be rewritten as:

(3) H(G)=pIT×logpITiRjR,ijpijT×logpijT

New message diffusions in time period [t1, t2] will create new edges and construct a new message diffusion graph G (that can be extended from G). Let lij be the number of new edges from region i to j in G, which are not included in G. Note that ∀i, j ∈ [1,|R|], lij ≥ 0.

Let |R|×|R| be the matrix of lij, and L=i,jlij where L ≪ ΩT). Let lI=iRlii be the number of new edges inside regions.

To measure the impact and the change to G caused by new message diffusion , we define Information Increment, G(G,), as follows:

(4) G(G,L¯)=(ωIT+lI)(ωIT+lI)i,jR,ij(ωijT+lij)(ωijT+lij)ωITωITi,jR,ijωijTωijT

According to equation (3), the social-entropy becomes:

(5) H(G)=ωIT+lIL+ΩTlogωIT+lIL+ΩT+ΩTiRjR,ijωijT+lijL+ΩTlogωijT+lijL+ΩT+ΩT

The following proposition prescribes the condition for the stability of divided regions to remain non-decreasing, based on the analysis of the OSN message diffusion graph.

P1.

Given a message diffusion graph G over a division of regions, the geo-homophily will not decrease, if G(G,) is no smaller than ΩTL, where L ≪ ΩT.

Proof. The degree of the geo-homophily of an OSN will not decrease if the social entropy never had a tendency to increase – i.e. ΔH is non-positive, where:

ΔH=H(G)H(G)=ωITΩTlogωIT+lIωITi,jR,ijωijTΩTlogωijT+lijωijTlIΩTlogωIT+lIΩTi,jR,ijlijΩTlogωijT+lijΩT

That is:

(6) ΔH=1ΩT(logΩTLlogG(G,L¯))

Then we can substitute G(G,L¯)ΩTL into equation (6) and we could conclude with this proposition. □

4. Population distribution projection

Given a division of regions, the geo-homophily is an indicator of the similarity between the structure of the OSN message diffusion graph and that of the division. The stronger geo-homophily an OSN has, more in-region communications occur between friends in the same region rather than across-region communications. Whenever a new user joins the OSN, he/she is highly likely to be distributed to the region where most of his/her friends reside. This is similar to the Chinese restaurant process (one representation of DP), which describes how guests are assigned to different tables in the restaurant according to the existing guest distribution.

In this section, we present a Bayesian nonparametric model based on the DP, which predicts how users in a OSN with strong geo-homophily are distributed over a given division of regions. In contrast, the weak geo-homophily in the OSN over given regions fails to establish the link between OSN message diffusion and the user distribution, which leads to a low prediction accuracy.

4.1 User distribution model

We propose a user distribution model (UDM) on basis of the Dirichlet process mixture (DPM) model for learning the hyper-parameters of the gathering mode, which is defined as a distribution of a random probability measure u. A UDM has two parameters: base distribution u0 which is considered as the mean of DP and the scale parameter α which is like an inverse-variance of the DP. Then we have:

UUDM(α,U0)
representing a draw of a random probability measure u over a given parameter space 𝕌 from the corresponding DP. For every user uV, we can draw a relevant θu from u. Here, α affects the probability that θu = θv, uv. Thus, sampling from UDM is executed by the following generative process:
UUDM(α,U0)θuUruF(θu)
where F is the likelihood function determining which region user u belongs to. Due to the cluster property, the number of distinct θ’s would be exactly |R|, far less than |V|. Let θ̃r,rR be the non-redundant hyper-parameters.

We have u in |R| dimensions where rRαr=α, i.e.:

UDir({αr}rR)

Define nr be the amount of ru that equals to r for every user u, and we can deduce the posterior distribution as:

P({θr˜}rR|{nr}rR)Mult({nr}rR|{θr˜}rR)Dir({θr˜}rR|{αr}rR)rRθr˜αr1Γ(rRαr)rRΓ(αr)rRθr˜nrrRθr˜αr1rRθr˜nr=rRθr˜nr+αr1=Dir({θr˜}rR|{αr+nr}rR)

Thus, the marginal probability would be:

P({nr}rR)={θr˜}rRP({θr˜}rR|{nr}rR)=Γ(rRαr)rRΓ(αr){θr˜}rRrRθr˜nr+αr1=Γ(rRαr)rRΓ(αr)rRΓ(αr+nr)Γ(|V|+rRαr)

According to the Bayesian theory, for user uV, the predictive distribution becomes:

P(ru=r{rv}vV)=P(ru=r,{rv}vV)P({rv}vV)=P({nr+1}{nr}rR,rr)P({nr}rR)=Γ(V+rRαr)Γ(V+1+rRαr)Γ(αr+nr+1)Γ(αr+nr)=nr+αrV+rRαr

4.2 A special case of Chinese restaurant process

The process of distributing users over multiple regions is a special case of Chinese restaurant process (Aldous, 1993), given that |R| is finite. Whenever a new user joins the OSN, he/she needs to choose a region to stay, by considering the distribution of his/her friends in the given regions:

  • When the OSN has a strong geo-homophily over the regions, people prefer to communicate and stay with their friends in the same region.

  • When the OSN owns a weak geo-homophily, users may communicate with online friends in a region but stay with offline acquaintances in another different region.

4.2.1 Parameters in the view of stick-breaking representation.

Although nr’s are statistic variables that can be obtained directly, the scale parameters are not easy to compute. To avoid manual assignment of αr, we change our view of the problem to be an equivalent one, i.e the stick-breaking representation.

The posterior distribution of u over θ̃ is deduced as:

P(U|{θr˜}rR)P({θr˜}rR|U)P(U)=UP(U)

So we have:

U|{θr̃}rRUPM(α+1,αU0+δθα+1)
where δθ̃ is a probability measure concentrated at θ̃

Consider a partition (θ′,𝕌\θ′), we have:

(U(θ),U(U\θ))Dir((α+1)αU0+δθ˜α+1(θ),(α+1)αU0+δθ˜α+1(U\θ))=Beta(1,α)

Serialize each region from 1 to |R|, and the stick-breaking procedure is then deduced by:

UUPM(α,U0)=β1δθ1˜+(1β1)U1==i=1|R|πiδθi˜
where βi ∼ Beta (1,α) for i ≠ |R| and β|R| = 1, whereas:
πi=(1j=1i1πj)βi

The posterior distribution of βi satisfies

p(βr|{nr}rR,α)p(nr,|V||βr)p(βr|α)

5. Floating population inference

In the physical world, people may move across regions periodically or temporally, thereby greatly influencing the geo-homophily of the OSN they use. In general, there are two important regions for every person, that is, the home region denoted as ℋ, and the remote region denoted as ? (e.g. the work place). According to the previous study (Cho et al., 2011), most of the message diffusions usually occur in or between these two regions (e.g. an OSN user in the remote region contacts his families at home region or his colleagues at the same remote region). With these observations, we leverage the geo-attributes of message diffusions between the sender and receiver to infer the distribution of FP.

5.1 Distribution of message diffusions

We use a tetrad 𝕊 = (ℂ,ℚ,λ,χ) to represent the state of the message diffusion graph. Consider a state when the population distribution is captured as ℂ = {ci}iR, where ci represents the proportion of the population of region i.

Denote the real population distribution as ℚ = {qij}i,jR, where qij means the proportion of people whose remote region is region j, whereas their home region is region i. We have ci=jRqji... Let σij be the proportion of users in j with home region i, i.e. σij=qijcj. Similar to UDM, σij’s in a specific region can also be generated from a DP.

Given a sender region, the amount of region-to-region communication is proportional to the population of the receiver region. Then for every receiver region r, we have:

P(r|rH,rW)={λ+(1λχ)crr=rH,rHrWχ+(1λχ)crr=rW,rHrWλ+χ+(1λχ)crr=rH=rW(1λχ)crotherwise
where λ is the proportion of communications with the home region, and χ is the proportion of communications with the remote region.

State difference. Define a baseline state 𝕊′ = (ℂ′,ℚ′,λ,χ), ℂ′ = {ci}iR, where all people stay at their home regions, i.e. ∀i, jR, ij, the corresponding σij = 0. Consider the difference between an arbitrary state 𝕊 and the baseline state, named as state difference Δ𝕊.

P2.

The state difference follows a superposition of a uniform distribution and a Dirichlet distribution.

Proof. The proportion of messages from r? to rτ should be:

PS(rT=j|rO=i)=rHRP(j|rH,rW=i)σrHi=(1λχ)cj+λσji+[j=i]χσii

Therefore, we can deduce that:

(7) PΔS(rT=j|rO=i)=PS(rT=j|rO=i)PS(rT=j|rO=i)={(1λχ)(cjcj)+λσjiij(1λχ)(cjcj)+(λ+χ)(σii1)i=j
which is a constant plus a variable generated from DP. It indicates that the state difference follows a superposition of a uniform distribution and a Dirichlet distribution.

This proposition enlightens us to infer FP by methods of divide and conquer. The state difference reduces the weight of the uniform distribution component.

5.2 Export message pattern

Similar to UDM, we can extract the distribution of messages diffused to remote regions, and we use a Hierarchy DP to find the distribution, which is named as the export message pattern (EMP). For every region i, denote σi as {σji}i j, following:

B0DP(τ,B)BiDP(τi,B0)ηiBiσiF(ηi)
where ηi is the hyper-parameters, τi and τ′ is the corresponding scale parameter and 𝔹′ is the base distribution. Consider the differential export message:
di={dij=PΔS(j|i)(1λχ)(cjcj)}ij
which satisfies that:
di/λF(ηi)

Given di, Gibbs Sampling can be used to decide what σi should be.

5.3 Self message pattern

The DPM can also explain the distribution of messages diffused inside each region, which is named as self message pattern (SMP). According to equation (7), it is not wise to gather σiiiR. Instead, we should concern {σ0i = 1–σii}i∈R and denote it as σ0. We are able to find a scale parameter τ0 and base distribution𝕀0 such that:

IDP(τ0,I0)η0Iσ0F(η0)

Because we have access to:

d0={d0i=(1λχ)(cici)PΔS(i|i)}
following d0/(λ + χ) ∼ F(η0), the model can be solved by Gibbs sampling according to the posterior distribution and the restriction holding jσji=1.

5.4 Floating population inference model

Finally, we combine UDM, EMP and SMP as a floating population inference model (FPIM). The UDM provides the population distribution across regions, whereas EMP and SMP compute the specific allocation inside each region. The model structure is shown in Figure 2.

6. Evaluation

In this section, we validate the geo-homophily over two real-world OSN data sets that have geo attributes of users and evaluate the performance of proposed UDM and FPIM models.

6.1 Data sets

We use data sets of two OSNs: Gowalla data set and WeChat Moment data set. The former one covers most of western countries, whereas the latter covers the China mainland (where Internet censorship is enforced and people have restricted access to popular OSN sites/apps like Facebook).

“Gowalla” (Cho et al., 2011) is a typical LBSN where users share their locations by “checking-in”. The information regarding friend relationship was collected using their public API, which consists of 196,591 nodes and 950,327 edges. The edges can be seen as undirected. This Gowalla data set collects a total of 6,442,890 check-ins of these users over the time period from February 2009 to October 2010.

“WeChat Moments (WM)” (Schiavenza, 2013) is the social network of a mobile messaging app (Wechat) popular in China, where the contents shared over WM are HTML5 pages (Zhang et al., 2016). This WM data set contains 137,509,889 users with 1,671,692,424 retweeting/forwarding records of 329,465 pages from January 14, 2016 to February 27, 2016, telling us when, where, from whom a page is re-tweeted; how many pages a user reads; and whether one has re-tweeted a page. WM can only be used on mobile devices, and the user location can be inferred from the IP address. The period of data covers Spring Festival, a traditional festival in China when most of Chinese people migrate back to their home province from the work place.

Note that although the number of users of each data set is much less than the population of a country, it is sufficiently large to derive the proportion of OSN user distribution, as well as the population distribution over geographical regions, which helps us determine how a new OSN user is distributed or how FP varies across regions.

6.2 Geo-homophily of online social networks

As mentioned in Section 3, we can divide users of an OSN into a division of regions, according to users’ geo attributes.

6.2.1 Geo-homophily of WeChat

6.2.1.1 Message diffusion in China.

The WM data set records the page re-tweeting in 34 provinces in China, and we use these provinces as the geographical regions in this experiment. Every user in WM should have viewed a collection of pages, and each page view’s IP address corresponds to a province, among which the most frequently recorded one is set as the province where the user is located. We analyze the message diffusion process in two time periods:

  1. Before Spring Festival, we monitor the message diffusion from January 14 to January 31, 2016, which are pre-holiday working and weekend days.

  2. On the Spring Festival day, most people stay at home, and hence the structure of the message diffusion graph would be different.

6.2.1.2 Results for pre-holidays.

The modularity in the pre-holidays is approximately 0.49. Figure 3(a) shows the volume of message diffusion inside each province and that between every pair of provinces of China, where the amount of message diffusion inside a province is proportional to the size of the corresponding circle, and the amount between provinces are represented by the length of arcs:

  • The larger size an orange circle has, more friend relationships between two people exist inside the province labeled in the circle.

  • The shorter a blue arc is, more friend relationships exist between people in two different provinces whose corresponding circles are connected by the arc.

  • For a province whose corresponding circle have no arc connected, only a very small number of friend relationships exist between this province and another different one, and the resulting arc could be very long in proportion to the length of other arcs, and thus we skip plotting such very-long arcs in the figure.

The results indicate that most of the diffusions occur inside provinces, so the arcs are relatively sparse. In particular, there lies no arc between some pairs of circles in this figure, which does not mean that there is no message diffusion between the corresponding two provinces but implies that the message diffusion between them is much weaker than that between those pairs of circles having arcs. For example, there were only hundreds of message diffusions between Tibet and Taiwan in the data set; in contrast, several millions of message diffusions occur between Beijing and Guangdong. This can be explained by the fact that those provinces are at distant locations, or they have little communication with most provinces in China mainland.

6.2.1.3 Results on holiday.

On the Spring Festival holiday, most people stay with their families in their home province. The graph structure changes, as most of the messages are sent for appointments and greetings, and these diffusions mainly took place between friends in the same vicinity. Thus, the proportion of the diffusion inside regions increases, leading to a modularity of 0.53. The graph structure is illustrated in Figure 3(b), where some inter-province arcs disappear.

6.2.1.4 Results for the baseline graph.

However, results become quite different if we use the baseline graph where edges of diffusion graph during pre-holidays were placed at random (Newman, 2004). Then we obtain a chaotic segregation with the modularity of −0.05, which can hardly be said to have any geo-homophily. The amount of message diffusions inside and across these regions are shown in Figure 3(c). Compared to Figure 3(a), under the same scale of plotting, the distribution of circles representing regions are very dense and most of circles’ sizes are similarly small.

6.2.2 Geo-homophily of Gowalla.

The Gowalla data set provides latitudes and longitudes of check-ins, involving the users as well as the friend relationship among them. Over 80 per cent of the users are Americans or Europeans. Here, we use 50 states and a federal district of USA as the geographical communities. Because we find that the distribution of check-ins within the USA is approximately proportional to each state’s population[1], we conclude that there lies a certain degree of geo-homophily in Gowalla data set, and the corresponding modularity is 0.34.

6.3 Stability of divided regions

When considering the diffusion of a single page, we find that it will be reposted many times in the home region of the sender, whereas it may be sent to only a few non-home regions – those diffusions across regions only take up a small part. For example, we illustrate the distribution of views to a popular page with approximately one million views in Figure 4, where the page is originally sent from the region of Beijing.

Recall that we propose Information Increment to measure the change of geo-homophily between two time points in Section 3.2. To test its impact, we simulate eight instances of message diffusions and add them sequentially to the message diffusion graph at the end of Jan. 31 of the WM data set. For each simulated message diffusion, first we construct a Dirichlet distribution according to the previously formed message distribution by randomly selecting a province among 34 provinces as the sender region, from which we can obtain a multinomial distribution. One million retransmissions are then sampled through the multinomial distribution. The experimental results are shown in Figure 5, where the geo-homophily will not decrease when G(G,L¯)ΩTL and vice versa. This implies that the stability will not decrease when the previously mentioned condition is satisfied, which is consistent with Proposition 1.

6.4 Performance of user distribution model

Given the order of users’ joining the OSN and their home regions, we are able to train the UDM. We evaluate the performance of UDM on WM and Gowalla data sets, respectively.

On WM data set, we monitor the order of 30 million users’ joining the OSN and then predict the distribution of the next 10 million users, which are tested by 10 experiment runs (each run contains one million users).

As for Gowalla, we choose the group of first 100,000 users that have mostly checked in USA to be the training set, and use a group of 28,000 users as the testing set, which are tested by ten experiment runs as well.

Because we know the exact proportion of each region in the data set, we use histogram intersection (HI) to measure the prediction accuracy, which ranges between 0 and 1. Besides, we compare UDM to the baseline method (that naively predicts the future population of each region as proportional to the previously observed population of each region). The result is shown in Figure 6, which clearly indicates that UDM has better performance both on WM and Gowalla than the baseline method. We also observe that UDM provides a greater HI on the data set with a stronger geo-homophily (i.e. WM data set).

6.5 Performance of floating population inference model

In this subsection, we evaluate the performance of FPIM on WMeChat data set and compare it against the results of the latest national population census in China[2], which provides us the statistics of FP in China. Here, the FP in our experiments has excluded those whose home and remote regions are the same (e.g. those who rarely move out of the home region, as the work place and the home belong to the same region).

6.5.1 Correlation.

As mentioned above, people tend to stay at the home region during Spring Festival in China. Therefore, the state of the message diffusion graph during Spring Festival can be seen as the baseline state 𝕁′. We collect the statistics on February 8, the Spring Festival day.

Intuitively, one may think that the proportion of FP would have certain correlation with the proportion of message diffusion in each region, and this leads to a naive prediction method that directly uses the latter to infer the former. We plot the correlation coefficient between the predicted FP distribution and the real FP distribution in Figure 7(a), which is as low as 0.2, indicating a poor direct correlation between FP and message diffusion. Indeed, this is a special case which ignores the uniform part of P𝕁. Because P𝕁 holds the same superposition with PΔ𝕁, we then evaluate the performance of FPIM based on P𝕁, as shown in Figure 7(b). The correlation coefficient is about 0.40, which is due to the uniform part of P𝕁, leading to a biased sampling on DP.

In contrast to this, FPIM based on state difference works better, illustrated in Figure 7(c), where the correlation coefficient reaches 0.8, indicating that the population prediction approximates the distribution derived from the national population census. Here, we notice in the WM data set that the mean of distribution difference Δℂ = ℂ – ℂ′ is approximately 0, whereas the variance is about 1.4 × 10−4. In other words, FPIM has significantly reduced the impact of the uniform part on PΔ𝕁.

By comparing the ticks over the x-axis and y-axis of Figure 7(c), we observe that FPIM predicts a FP (ticks over the x-axis) lower than that obtained in the national census (ticks over the y-axis). This can be attributed to the fact that a non-negligible proportion of FP do not view the WM pages or may not even use WM. As mentioned earlier, although there exist people not covered by the WM data set, the number of users in the data set is sufficiently large to derive the distributions using the proposed models.

6.5.2 Prediction correctness.

Apart from correlation, we always have a concern on the densely populated region which has the most of a large FP that may cause changes to the online and offline social networks. We use the sets of regions who have the most proportion of FPs to measure the prediction correctness of FPIM.

For every province r, FPIM calculates the proportion of FP, by two sets, i.e. the set of emigrants whose currently located region is the remote region but the home region is r, and the set of immigrants whose currently located region is their remote region r but the home region is different.

Then, we rank the provinces by the number of immigrants and emigrants and obtain a ranking of provinces on immigrants and a ranking of provinces on emigrants, respectively. Meanwhile, the FP data of the national population census can also produce two rankings of provinces on immigrants and emigrants.

We compare the corresponding rankings obtained from FPIM and the national census and calculate the overlapping rate between two rankings on immigrants or emigrants (which is defined as the number of regions that appear in both rankings divided by the total number of regions in a ranking) over the top-y provinces according to their normalized proportion values. We vary y from 1 to 10 and plot the histogram in Figure 7(d), telling that FPIM works satisfactorily with a match between our prediction results and the data of the national census. The two types of rankings have a high consistency on Δ𝕁. Besides, the correctness on Δ𝕁 is higher than that calculated on basis of 𝕁 the performance of FPIM on predicting the set of top provinces on emigrants is better than that on predicting the set of top provinces on immigrants, which is a result of the fact that FPIM uses σij’s which pay more attention on the emigrant proportion.

7. Conclusions

In this paper, we propose a systematic study on the population distribution projection over offline geographical regions by analyzing the geographical attributes of OSNs. We propose the concept of geo-homophily in OSNs to establish the correlation between online message diffusion and the stability of geographical regions where a population distribution can be drawn. We formulate the population distribution problem from the perspective of DP and present prediction models to show the process that OSN users are distributed into regions, and infer the FP across regions. By experiments over the large-scale data sets, it is shown that the online message diffusions can help evaluate the stability of geographical regions, which further facilitates the determination of population distribution over fixed regions; the proposed prediction models have a high prediction accuracy in inferring the change of FP across regions.

Figures

A three-layered analytical framework that defines the geo-homophily of OSNs to map the OSN message diffusion (Layer 1) to the offline user distribution (Layer 2) and infers the FP (Layer 3) based on the derived distribution (Layer 2)

Figure 1.

A three-layered analytical framework that defines the geo-homophily of OSNs to map the OSN message diffusion (Layer 1) to the offline user distribution (Layer 2) and infers the FP (Layer 3) based on the derived distribution (Layer 2)

The FPIM has three parts, namely, UDM, EMP, SMP from left to right

Figure 2.

The FPIM has three parts, namely, UDM, EMP, SMP from left to right

Graph representations of message diffusion inside and across provinces in WM data set

Figure 3.

Graph representations of message diffusion inside and across provinces in WM data set

The viewing distribution of a hot message originated from Beijing

Figure 4.

The viewing distribution of a hot message originated from Beijing

The change of modularity toward information increment

Figure 5.

The change of modularity toward information increment

Performance of UDM on WM and Gowalla data sets

Figure 6.

Performance of UDM on WM and Gowalla data sets

Results of inferring the FP that has excluded those whose home and remote regions are the same

Figure 7.

Results of inferring the FP that has excluded those whose home and remote regions are the same

Notes

References

Aldous, D.J. (1993), “Exchangeability and related topics”, École d’Été de Probabilités de Saint-Flour, Vol. 33, pp. 1-198.

Backstrom, L., Sun, E. and Marlow, C. (2010), “Find me if you can: improving geographical prediction with social and spatial proximity”, Proceedings of the 19th International Conference on World Wide Web, pp. 61-70.

Chi, G. (2010), “The impacts of highway expansion on population change: an integrated spatial approach”, Rural Sociology, Vol. 75 No. 1, pp. 58-89.

Cho, E., Myers, S.A. and Leskovec, J. (2011), “Friendship and mobility: user movement in location-based social networks”, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1082-1090.

Crandall, D.J., Backstrom, L., Cosley, D., Suri, S., Huttenlocher, D. and Kleinberg, J. (2010), “Inferring social ties from geographic coincidences”, Proceedings of the National Academy of Sciences, Vol. 107 No. 52, pp. 22436-22441.

Gao, C., Zhang, Y., Bian, K., Li, Z., Bai, Y. and Liu, X. (2017), “Holiday syndrome: a measurement study of mobile social network use during holidays”, 2017 IEEE International Conference on Communications (ICC), pp. 1-6.

Girvan, M. and Newman, M.E. (2002), “Community structure in social and biological networks”, Proceedings of the National Academy of Sciences, Vol. 99 No. 12, pp. 7821-7826.

Goldenberg, J. and Levy, M. (2009), “Distance is not dead: social interaction and geographical distance in the internet era”, arXiv preprint arXiv: 0906.3202.

Gonzalez, M.C., Hidalgo, C.A. and Barabasi, A.L. (2008), “Understanding individual human mobility patterns”, arXiv preprint arXiv: 0806.1256.

Guo, Z., Huang, J., He, J., Hei, X. and Wu, D. (2013), “Unveiling the patterns of video tweeting: a sina weibo-based measurement study”, International Conference on Passive and Active Network Measurement, pp. 166-175.

Harris, J.R. and Todaro, M.P. (1970), “Migration, unemployment and development: a two-sector analysis”, The American Economic Review, Vol. 60 No. 1, pp. 126-142.

Hristova, D., Musolesi, M. and Mascolo, C. (2014), “Keep your friends close and your facebook friends closer: a multiplex network approach to the analysis of offline and online social ties”, ICWSM.

Kido, H., Yanagisawa, Y. and Satoh, T. (2005), “An anonymous communication technique using dummies for location-based services”, Proceedings: International Conference on Pervasive Services, 2005: ICPS’05, pp. 88-97.

Li, Z., Ding, B., Han, J., Kays, R. and Nye, P. (2010), “Mining periodic behaviors for moving objects”, Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1099-1108.

Li, Z., Chen, L., Bai, Y., Bian, K. and Zhou, P. (2016), “On diffusion-restricted social network: a measurement study of wechat moments”, 2016 IEEE International Conference on Communications (ICC), pp. 1-6.

Liao, Y., Bian, K., Song, L. and Han, Z. (2015), “Full-duplex MAC protocol design and analysis”, IEEE Communications Letters, Vol. 19 No. 7, pp. 1185-1188.

National Bureau of Statistics of China (2010), “2010 population census”, available at: www.stats.gov.cn/zgrkpc/dlc/yw/t20110428\_402722384.htm

Nazir, A., Raza, S. and Chuah, C.N. (2008), “Unveiling facebook: a measurement study of social network based applications”, Proceedings of the 8th ACM SIGCOMM Conference on Internet Measurement, pp. 43-56.

Neal, R.M. (2000), “Markov chain sampling methods for Dirichlet process mixture models”, Journal of Computational and Graphical Statistics, Vol. 9 No. 2, pp. 249-265.

Newman, M.E. (2004), “Fast algorithm for detecting community structure in networks”, Physical Review E, Vol. 69 No. 6, p. 066133.

Schiavenza, M. (2013), “Wechat–not weibo–is the chinese social network to watch”, The Atlantic, p. 30.

Wang, C., Tang, S., Yang, L., Guo, Y., Li, F. and Jiang, C. (2014), “Modeling data dissemination in online social networks: a geographical perspective on bounding network traffic load”, Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 53-62.

Zhang, Y., Bai, Y., Chen, L., Bian, K. and Li, X. (2016), “Influence maximization in messenger-based social networks”, 2016 IEEE Global Communications Conference (GLOBECOM), pp. 1-6.

Zheng, Y., Xie, X. and Ma, W.Y. (2010), “Geolife: a collaborative social networking service among user, location and trajectory”, IEEE Data Engineering and Bulletin, Vol. 33 No. 2, pp. 32-39.

Zheng, Y. (2012), “Tutorial on location-based social networks”, Proceedings of the 21st International Conference on World Wide Web, Vol. 12 No. 5.

Acknowledgements

This work was supported by National Natural Science Foundation of China under grant number 61572051 and 61632017 and by the National 973 Grant under grant number 2014CB340405.

Corresponding author

Yuanxing Zhang can be contacted at: longo@pku.edu.cn

About the authors

Yuanxing Zhang is a PhD student at the School of Electrical Engineering and Computer Science, Peking University, China. He received his B.S. degree in computer science from Beijing University of Technology in 2015. His current research interests include AI-assisted resource allocation and recommender system.

Zhuqi Li is a PhD student at the Computer Science Department at Princeton University, USA. He received his B.S. degree in computer science from Peking University in 2017. His current research interests include social network and mobile sensing.

Kaigui Bian received the PhD degree in computer engineering from Virginia Tech, Blacksburg, USA in 2011. He is currently an associate professor in the Institute of Network Computing and Information Systems, School of EECS, Peking University. His research interests include mobile computing, cognitive radio networks, network security, and privacy.

Yichong Bai received the B.S. degree in computer science from Peking University in 2014. He was the COO of Fibonacci Data Consulting Services Inc., Shenzhen, Guangdong, China.

Zhi Yang received the BS degree from the Harbin Institute of Technology, in 2005, and the PhD degree in computer science from Peking University, in 2010. He is currently an associate professor at Peking University. His research interests include the areas of security and privacy, networked and distributed systems, and data intensive computing.

Xiaoming Li graduated from Stevens Institute of Technology, New Jersey, with a PhD in computer science. He is now a professor at Peking University. His research interests include search engines and web mining. He is a Fellow of the Computer Federation of China and a member of Eta Kappa Nu. He serves on the Editorial Board of Concurrency and Computation (Wiley). He received the CCF Wang Xuan Award and Outstanding Educator Award in 2013 and 2014, respectively.

Related articles