RECAST: Telling Apart Social and Random Relationships in Dynamic Networks
Résumé
When constructing a social network from interactions among people (e.g., phone calls, encounters), a crucial task is to define the threshold that separates social from random (or casual) relationships. The ability to accurately identify social relationships becomes essential to applications that rely on a precise description of human routines, such as recommendation systems, forwarding strategies and opportunistic dissemination protocols. We thus propose a strategy to analyze users' interactions in dynamic networks where entities act according to their interests and activity dynamics. Our strategy, named \textit{\classifierE (\classifier)}, allows classifying users interactions, separating random ties from social ones. To that end, \classifier observes how the real system differs from an equivalent one where entities' decisions are completely random. We evaluate the effectiveness of the \classifier classification on five real-world user contact datasets collected in diverse networking contexts. Our analysis unveils significant differences among the dynamics of users' wireless interactions in the datasets, which we leverage to unveil the impact of social ties on opportunistic routing. We show that, for such specific purpose, the relationships inferred by \classifier are more relevant than, e.g., self-declared friendships on Facebook.
Origine | Fichiers produits par l'(les) auteur(s) |
---|