Construction of Directed 2K Graphs
Social and Information Networks
2017-03-22 v1 Data Structures and Algorithms
Abstract
We study the problem of constructing synthetic graphs that resemble real-world directed graphs in terms of their degree correlations. We define the problem of directed 2K construction (D2K) that takes as input the directed degree sequence (DDS) and a joint degree and attribute matrix (JDAM) so as to capture degree correlation specifically in directed graphs. We provide necessary and sufficient conditions to decide whether a target D2K is realizable, and we design an efficient algorithm that creates realizations with that target D2K. We evaluate our algorithm in creating synthetic graphs that target real-world directed graphs (such as Twitter) and we show that it brings significant benefits compared to state-of-the-art approaches.
Keywords
Cite
@article{arxiv.1703.07340,
title = {Construction of Directed 2K Graphs},
author = {Bálint Tillman and Athina Markopoulou and Carter T. Butts and Minas Gjoka},
journal= {arXiv preprint arXiv:1703.07340},
year = {2017}
}