arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.00664cs.SIcs.DC
收藏

Darwini:生成真实的大规模社交图

Darwini: Generating realistic large-scale social graphs

Sergey Edunov, Dionysios Logothetis, Cheng Wang, Avery Ching, Maja Kabiljo

摘要:

合成图生成器通过提供对数据(例如,类似于社交网络的图)的访问来促进图算法和处理系统中的研究,同时规避隐私和安全问题。然而,它们的实用价值在于它们能够捕获真实图的重要度量,例如度分布和聚类特性。图形生成器还必须能够以真实世界行业图形的规模生成这样的图形,即数千亿或数万亿条边。在本文中,我们提出了Darwini,一个图形生成器,它捕获了一些真正的图形的核心特征。重要的是,给定一个源图,它可以再现度分布,与现有方法不同,它可以再现局部聚类系数和联合度分布。此外,Darwini维护了诸如节点PageRank、特征值和源图的K-核心分解等度量。将Darwini与最先进的生成模型进行比较,我们发现它可以更准确地再现这些特征。最后,我们在以顶点为中心的Apache GitHub模型上提供了我们方法的开源实现,该模型允许我们创建具有1万亿条边的合成图。

英文摘要:

Synthetic graph generators facilitate research in graph algorithms and processing systems by providing access to data, for instance, graphs resembling social networks, while circumventing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of real graphs, such as degree distribution and clustering properties. Graph generators must also be able to produce such graphs at the scale of real-world industry graphs, that is, hundreds of billions or trillions of edges. In this paper, we propose Darwini, a graph generator that captures a number of core characteristics of real graphs. Importantly, given a source graph, it can reproduce the degree distribution and, unlike existing approaches, the local clustering coefficient and joint-degree distributions. Furthermore, Darwini maintains metrics such node PageRank, eigenvalues and the K-core decomposition of a source graph. Comparing Darwini with state-of-the-art generative models, we show that it can reproduce these characteristics more accurately. Finally, we provide an open source implementation of our approach on the vertex-centric Apache Giraph model that allows us to create synthetic graphs with one trillion edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑