Generating Synthetic Social Graphs with Darwini

Synthetic graph generators facilitate research in graph algorithms and graph processing systems by providing access to graphs that resemble real social networks while addressing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of r...

Full description

Saved in:
Bibliographic Details
Main Authors: Edunov, Sergey, Logothetis, Dionysios, Wang, Cheng, Ching, Avery, Kabiljo, Maja
Format: Conference Proceeding
Language:English
Subjects:
Benchmark testing
Clustering algorithms
Computational modeling
facebook social graph
Generators
graph analytics
graph generator
Mathematical model
Measurement
Social network services
social networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Synthetic graph generators facilitate research in graph algorithms and graph processing systems by providing access to graphs that resemble real social networks while addressing 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 distribution. Furthermore, Darwini maintains a number of metrics, such as graph assortativity, eigenvalues, and others. 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 Darwini on the vertex-centric Apache Giraph model that can generate synthetic graphs with up to 3 trillion edges.
ISSN:2575-8411
DOI:10.1109/ICDCS.2018.00062