Generating Large Semi-Synthetic Graphs of Any Size
Rodrigo Tuna, Carlos Soares

TL;DR
This paper introduces LGSG, a novel graph generation framework using diffusion models and node embeddings, capable of producing large, diverse graphs without retraining, overcoming limitations of previous ID-dependent models.
Contribution
LGSG is the first framework to generate variable-sized graphs without relying on node IDs, enabling scalable and attribute-aware graph synthesis.
Findings
LGSG matches baseline models on standard metrics.
LGSG outperforms baselines on clustering tendencies.
LGSG maintains structural consistency across sizes.
Abstract
Graph generation is an important area in network science. Traditional approaches focus on replicating specific properties of real-world graphs, such as small diameters or power-law degree distributions. Recent advancements in deep learning, particularly with Graph Neural Networks, have enabled data-driven methods to learn and generate graphs without relying on predefined structural properties. Despite these advances, current models are limited by their reliance on node IDs, which restricts their ability to generate graphs larger than the input graph and ignores node attributes. To address these challenges, we propose Latent Graph Sampling Generation (LGSG), a novel framework that leverages diffusion models and node embeddings to generate graphs of varying sizes without retraining. The framework eliminates the dependency on node IDs and captures the distribution of node embeddings and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
