在线社交网络的多重图抽样
Multigraph Sampling of Online Social Networks
摘要:
用于在线社交网络(OSN)的用户的概率采样的现有技术基于单个社交关系(通常是友谊)上的随机游走。虽然功能强大,但这些方法依赖于完全连接的社交图。此外,采样过程的混合时间强烈依赖于该图的特性。在本文中,我们观察到OSN用户之间经常存在其他关系,例如同一组的成员身份或参与同一事件。我们建议利用这些关系诱导的图形,通过执行一个随机游走在他们的工会多重图。我们设计了一种计算效率高的方法来执行多重图采样随机选择的图形上行走在每次迭代。我们证明了我们的方法的好处,通过(i)模拟合成图,和(ii)测量Last.fm-一个互联网网站的音乐与社交网络功能。更具体地说,我们表明,多重图采样可以获得一个代表性的样本和更快的收敛,即使个别图失败,即,是不相连的或是高度聚集的
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。