DeepGG: a Deep Graph Generator
arXiv:2006.04159 · doi:10.1007/978-3-030-74251-5_25
Abstract
Learning distributions of graphs can be used for automatic drug discovery, molecular design, complex network analysis, and much more. We present an improved framework for learning generative models of graphs based on the idea of deep state machines. To learn state transition decisions we use a set of graph and node embedding techniques as memory of the state machine. Our analysis is based on learning the distribution of random graph generators for which we provide statistical tests to determine which properties can be learned and how well the original distribution of graphs is represented. We show that the design of the state machine favors specific distributions. Models of graphs of size up to 150 vertices are learned. Code and parameters are publicly available to reproduce our results.
arXiv comment8 pages condensed preprint with github link, under review
References in corpus (13)
- Statistical mechanics of complex networks
- Semi-Supervised Classification with Graph Convolutional Networks
- Neural Message Passing for Quantum Chemistry
- Junction Tree Variational Autoencoder for Molecular Graph Generation
- Kronecker Graphs: An Approach to Modeling Networks
- Discriminative Embeddings of Latent Variable Models for Structured Data
- GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models
- Learning Deep Generative Models of Graphs
- Average path length in random networks
- Average path length in uncorrelated random networks with hidden variables
- Improving Chemical Autoencoder Latent Space and Molecular De novo Generation Diversity with Heteroencoders
- Efficient Graph Generation with Graph Recurrent Attention Networks
- Molecular Generation with Recurrent Neural Networks (RNNs)