Fig. 1. Generative modeling of layouts for the Les Misérables character co-occurrence network [55]. We train our generative model to construct a 2D latent space by learning from a collection of example layouts (training samples). From the grid of generated samples, we can see the smooth transitions between the different layouts. This shows that our model is capable of learning and generalizing abstract concepts of graph layouts, not just memorizing the training samples. Users can use this sample grid of the latent space as a WYSIWYG interface to generate a layout they want, without either blindly tweaking parameters of layout methods or requiring expert knowledge of layout methods. The color mapping of the latent space represents the shape-based metric [23] of the generated samples. Throughout the paper, unless otherwise specified, the node color represents the hierarchical community structure of the graph [68,79], so readers can easily compare node locations in different layouts. An interactive demo is available in the supplementary material [1].Abstract-Different layouts can characterize different aspects of the same graph. Finding a "good" layout of a graph is thus an important task for graph visualization. In practice, users often visualize a graph in multiple layouts by using different methods and varying parameter settings until they find a layout that best suits the purpose of the visualization. However, this trial-and-error process is often haphazard and time-consuming. To provide users with an intuitive way to navigate the layout design space, we present a technique to systematically visualize a graph in diverse layouts using deep generative models. We design an encoder-decoder architecture to learn a model from a collection of example layouts, where the encoder represents training examples in a latent space and the decoder produces layouts from the latent space. In particular, we train the model to construct a two-dimensional latent space for users to easily explore and generate various layouts. We demonstrate our approach through quantitative and qualitative evaluations of the generated layouts. The results of our evaluations show that our model is capable of learning and generalizing abstract concepts of graph layouts, not just memorizing the training examples. In summary, this paper presents a fundamentally new approach to graph visualization where a machine learning model learns to visualize a graph from examples without manually-defined heuristics.Machine learning approaches to graph-structured data, such as social networks and biological networks, require an effective representation of the graph structure. Recently, many graph neural networks (GNNs) have been proposed for representation learning on graphs, such as graph convolutional networks [53], GraphSAGE [39], and graph isomorphism networks [84]. They have achieved state-of-the-art performance for many tasks, such as graph classification, node classification, and link prediction. We also use GNNs for learning the complex relationship between ...