Measuring and mitigating behavioural segregation using Call Detail Records

The overwhelming amounts of data we generate in our daily routine and in social networks has been crucial for the understanding of various social and economic factors. The use of this data represents a low-cost alternative source of information in parallel to census data and surveys. Here, we advocate for such an approach to assess and alleviate the segregation of Syrian refugees in Turkey. Using a large dataset of mobile phone records provided by Turkey's largest mobile phone service operator, Türk Telekom, in the frame of the Data 4 Refugees project, we define, analyse and optimise inter-group integration as it relates to the communication patterns of two segregated populations: refugees living in Turkey and the local Turkish population. Our main hypothesis is that making these two communities more similar (in our case, in terms of behaviour) may increase the level of positive exposure between them, due to the well-known sociological principle of homophily. To achieve this, working from the records of call and SMS origins and destinations between and among both populations, we develop an extensible, statistically-solid, and reliable framework to measure the differences between the communication patterns of two groups. In order to show the applicability of our framework, we assess how house mixing strategies, in combination with public and private investment, may help to overcome segregation. We first identify the districts of the Istanbul province where refugees and local population communication patterns differ in order to then utilise our framework to improve the situation. Our results show potential in this regard, as we observe a significant reduction of segregation while limiting, in turn, the consequences in terms of rent increase

On the Troll-Trust Model for Edge Sign Prediction in Social Networks

In the problem of edge sign prediction, we are given a directed graph (representing a social network), and our task is to predict the binary labels of the edges (i.e., the positive or negative nature of the social relationships). Many successful heuristics for this problem are based on the troll-trust features, estimating at each node the fraction of outgoing and incoming positive/negative edges. We show that these heuristics can be understood, and rigorously analyzed, as approximators to the Bayes optimal classifier for a simple probabilistic model of the edge labels. We then show that the maximum likelihood estimator for this model approximately corresponds to the predictions of a Label Propagation algorithm run on a transformed version of the original social graph. Extensive experiments on a number of real-world datasets show that this algorithm is competitive against state-of-the-art classifiers in terms of both accuracy and scalability. Finally, we show that troll-trust features can also be used to derive online learning algorithms which have theoretical guarantees even when edges are adversarially labeled.Comment: v5: accepted to AISTATS 201