Modeling and generating graphs is fundamental for studying networks in biology, engineering, and social sciences. However, modeling complex distributions over graphs and then efficiently sampling from these distributions is challenging due to the non-unique, high-dimensional nature of graphs and the complex, non-local dependencies that exist between edges in a given graph. Here we propose GraphRNN, a deep autoregressive model that addresses the above challenges and approximates any distribution of graphs with minimal assumptions about their structure. GraphRNN learns to generate graphs by training on a representative set of graphs and decomposes the graph generation process into a sequence of node and edge formations, conditioned on the graph structure generated so far. In order to quantitatively evaluate the performance of GraphRNN, we introduce a benchmark suite of datasets, baselines and novel evaluation metrics based on Maximum Mean Discrepancy, which measure distances between sets of graphs. Our experiments show that GraphRNN significantly outperforms all baselines, learning to generate diverse graphs that match the structural characteristics of a target set, while also scaling to graphs 50 times larger than previous deep models.
翻译:建模和生成图解是研究生物、工程和社会科学网络的基础。然而,建模和生成图解对于在图表上建模复杂的分布,然后对这些分布进行高效的取样,由于图表的非独特性、高维性以及某个图中边缘之间存在的复杂、非局部依赖性,因此具有挑战性,因此具有挑战性。我们在此提出一个深度的自动递减模型GregRNN,这是一个应对上述挑战的深度自动递减模型,其结构假设为最低。GregRNN学会通过在具有代表性的图表集上进行培训来生成图解析图解析图解成一个节点和边缘结构的序列。为了从数量上评估GregRNN的性能,我们采用了一套基准数据集、基线和新评价指标的套套套,该套模型测量了各组图表之间的距离。我们的实验显示,GregRNNN明显地超越了所有基线,学习产生与一组目标结构特征相匹配的不同图表,同时将缩至比以前的模型大50倍的图表。