Computer Science – Networking and Internet Architecture
Scientific paper
2010-08-16
Computer Science
Networking and Internet Architecture
IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Measurement of Internet Topologies, 2011
Scientific paper
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation (typically friendship). While powerful, these methods rely on the social graph being fully connected. Furthermore, the mixing time of the sampling process strongly depends on the characteristics of this graph. In this paper, we observe that there often exist other relations between OSN users, such as membership in the same group or participation in the same event. We propose to exploit the graphs these relations induce, by performing a random walk on their union multigraph. We design a computationally efficient way to perform multigraph sampling by randomly selecting the graph on which to walk at each iteration. We demonstrate the benefits of our approach through (i) simulation in synthetic graphs, and (ii) measurements of Last.fm - an Internet website for music with social networking features. More specifically, we show that multigraph sampling can obtain a representative sample and faster convergence, even when the individual graphs fail, i.e., are disconnected or highly clustered.
Butts Carter T.
Gjoka Minas
Kurant Maciej
Markopoulou Athina
No associations
LandOfFree
Multigraph Sampling of Online Social Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multigraph Sampling of Online Social Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multigraph Sampling of Online Social Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-176464