pith. sign in

arxiv: 1802.08773 · v3 · pith:YMOEKIZBnew · submitted 2018-02-24 · 💻 cs.LG · cs.AI· cs.SI

GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models

classification 💻 cs.LG cs.AIcs.SI
keywords graphsgraphrnndeepgraphbaselinescomplexdistributionsgenerate
0
0 comments X p. Extension
pith:YMOEKIZB Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{YMOEKIZB}

Prints a linked pith:YMOEKIZB badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Discrete Bayesian Sample Inference for Graph Generation

    cs.LG 2025-11 unverdicted novelty 6.0

    GraphBSI uses Bayesian Sample Inference as noise-controlled SDEs to generate discrete graphs in one shot, achieving state-of-the-art results on molecular benchmarks Moses and GuacaMol.