Download PDFOpen PDF in browser

Generating synthetic social graphs with Darwini

EasyChair Preprint no. 108

11 pagesPublished: April 30, 2018


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 GiraphTM model that can generate synthetic graphs with up to 3 trillion edges.

Keyphrases: facebook social graph, graph analytics, graph generator, social networks

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Sergey Edunov and Dionysios Logothetis and Cheng Wang and Avery Ching and Maja Kabiljo},
  title = {Generating synthetic social graphs with Darwini},
  howpublished = {EasyChair Preprint no. 108},
  doi = {10.29007/pmhr},
  year = {EasyChair, 2018}}
Download PDFOpen PDF in browser