Keywords: Graph Generative models, GNN, Multinomial distribution
Abstract: In real world domains, graphs often have natural hierarchies.
However, data-driven graph generation is yet to effectively respect and exploit such structures.
We propose a novel approach that recursively generates community structures at multiple resolutions, with the generated structures conforming to training data distribution at each level of the hierarchy.
While the generation of a community at one level takes place sequentially, lower-level sub-structures of the community can be handled in parallel.
This significantly improves the speed of both generation and learning, resulting in $\mathcal{O}(\log n)$ generative rounds.
Our method is further supported by an expressive probability distribution for intermediate and leaf levels of this hierarchical model.
Our method achieves the state of the art performance in graph generation in both accuracy and efficiency on many datasets.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics
Submission Guidelines: Yes
Please Choose The Closest Area That Your Submission Falls Into: Generative models
Supplementary Material: zip
5 Replies
Loading