Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.11529 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914795178950656 |
|---|---|
| author | Bergmeister, Andreas Martinkus, Karolis Perraudin, Nathanaël Wattenhofer, Roger |
| author_facet | Bergmeister, Andreas Martinkus, Karolis Perraudin, Nathanaël Wattenhofer, Roger |
| contents | In the realm of generative models for graphs, extensive research has been conducted. However, most existing methods struggle with large graphs due to the complexity of representing the entire joint distribution across all node pairs and capturing both global and local graph structures simultaneously. To overcome these issues, we introduce a method that generates a graph by progressively expanding a single node to a target graph. In each step, nodes and edges are added in a localized manner through denoising diffusion, building first the global structure, and then refining the local details. The local generation avoids modeling the entire joint distribution over all node pairs, achieving substantial computational savings with subquadratic runtime relative to node count while maintaining high expressivity through multiscale generation. Our experiments show that our model achieves state-of-the-art performance on well-established benchmark datasets while successfully scaling to graphs with at least 5000 nodes. Our method is also the first to successfully extrapolate to graphs outside of the training distribution, showcasing a much better generalization capability over existing methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_11529 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Efficient and Scalable Graph Generation through Iterative Local Expansion Bergmeister, Andreas Martinkus, Karolis Perraudin, Nathanaël Wattenhofer, Roger Social and Information Networks Machine Learning In the realm of generative models for graphs, extensive research has been conducted. However, most existing methods struggle with large graphs due to the complexity of representing the entire joint distribution across all node pairs and capturing both global and local graph structures simultaneously. To overcome these issues, we introduce a method that generates a graph by progressively expanding a single node to a target graph. In each step, nodes and edges are added in a localized manner through denoising diffusion, building first the global structure, and then refining the local details. The local generation avoids modeling the entire joint distribution over all node pairs, achieving substantial computational savings with subquadratic runtime relative to node count while maintaining high expressivity through multiscale generation. Our experiments show that our model achieves state-of-the-art performance on well-established benchmark datasets while successfully scaling to graphs with at least 5000 nodes. Our method is also the first to successfully extrapolate to graphs outside of the training distribution, showcasing a much better generalization capability over existing methods. |
| title | Efficient and Scalable Graph Generation through Iterative Local Expansion |
| topic | Social and Information Networks Machine Learning |
| url | https://arxiv.org/abs/2312.11529 |