12,268 research outputs found
Fundamental structures of dynamic social networks
Social systems are in a constant state of flux with dynamics spanning from
minute-by-minute changes to patterns present on the timescale of years.
Accurate models of social dynamics are important for understanding spreading of
influence or diseases, formation of friendships, and the productivity of teams.
While there has been much progress on understanding complex networks over the
past decade, little is known about the regularities governing the
micro-dynamics of social networks. Here we explore the dynamic social network
of a densely-connected population of approximately 1000 individuals and their
interactions in the network of real-world person-to-person proximity measured
via Bluetooth, as well as their telecommunication networks, online social media
contacts, geo-location, and demographic data. These high-resolution data allow
us to observe social groups directly, rendering community detection
unnecessary. Starting from 5-minute time slices we uncover dynamic social
structures expressed on multiple timescales. On the hourly timescale, we find
that gatherings are fluid, with members coming and going, but organized via a
stable core of individuals. Each core represents a social context. Cores
exhibit a pattern of recurring meetings across weeks and months, each with
varying degrees of regularity. Taken together, these findings provide a
powerful simplification of the social network, where cores represent
fundamental structures expressed with strong temporal and spatial regularity.
Using this framework, we explore the complex interplay between social and
geospatial behavior, documenting how the formation of cores are preceded by
coordination behavior in the communication networks, and demonstrating that
social behavior can be predicted with high precision.Comment: Main Manuscript: 16 pages, 4 figures. Supplementary Information: 39
pages, 34 figure
SLIM : Scalable Linkage of Mobility Data
We present a scalable solution to link entities across mobility datasets using their spatio-temporal information. This is a fundamental problem in many applications such as linking user identities for security, understanding privacy limitations of location based services, or producing a unified dataset from multiple sources for urban planning. Such integrated datasets are also essential for service providers to optimise their services and improve business intelligence. In this paper, we first propose a mobility based representation and similarity computation for entities. An efficient matching process is then developed to identify the final linked pairs, with an automated mechanism to decide when to stop the linkage. We scale the process with a locality-sensitive hashing (LSH) based approach that significantly reduces candidate pairs for matching. To realize the effectiveness and efficiency of our techniques in practice, we introduce an algorithm called SLIM. In the experimental evaluation, SLIM outperforms the two existing state-of-the-art approaches in terms of precision and recall. Moreover, the LSH-based approach brings two to four orders of magnitude speedup
- …