NetGAN: Generating Graphs via Random Walks

Aleksandar Bojchevski,Oleksandr Shchur,Daniel Zügner,Stephan Günnemann

Published 2018 in International Conference on Machine Learning

ABSTRACT

We propose NetGAN - the first implicit generative model for graphs able to mimic real-world networks. We pose the problem of graph generation as learning the distribution of biased random walks over the input graph. The proposed model is based on a stochastic neural network that generates discrete output samples and is trained using the Wasserstein GAN objective. NetGAN is able to produce graphs that exhibit the well-known network patterns without explicitly specifying them in the model definition. At the same time, our model exhibits strong generalization properties, as highlighted by its competitive link prediction performance, despite not being trained specifically for this task. Being the first approach to combine both of these desirable properties, NetGAN opens exciting further avenues for research.

PUBLICATION RECORD

  • Publication year

    2018

  • Venue

    International Conference on Machine Learning

  • Publication date

    2018-03-02

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-44 of 44 references · Page 1 of 1

CITED BY

Showing 1-100 of 400 citing papers · Page 1 of 4