Generating Large Semi-Synthetic Graphs of Any Size

Rodrigo Tuna, Carlos Soares
7/2/2025
cs.SIcs.AI

No official code found. Best implementation: rodrigotuna/LGSG (0 stars, MIT, last commit 2025-01-11).

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 subgraph structures, enabling scalable and flexible graph generation. Experimental results show that LGSG performs on par with baseline models for standard metrics while outperforming them in overlooked ones, such as the tendency of nodes to form clusters. Additionally, it maintains consistent structural characteristics across graphs of different sizes, demonstrating robustness and scalability.

View on arXivView PDF

Code Implementations(1)

rodrigotuna/LGSGCommunity71%
MIT

Code for the paper "Generating Large Semi-Synthetic Graphs of Any Size"

00C++, ShellJan 4, 20251 years agoMIT

Similar Papers

Cite this paper

@article{tuna2025generating,
  title  = {Generating Large Semi-Synthetic Graphs of Any Size},
  author = {Rodrigo Tuna and Carlos Soares},
  year   = {2025},
  eprint = {2507.02166},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.02166v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.02166.svg)](https://codeofpaper.com/paper/2507.02166)

Discussion