Efficient Synthetic Network Generation via Latent Embedding Reconstruction
Not on the map. Why?
Abstract (arXiv)
Network data are ubiquitous across the social sciences, biology, and information systems. Generating realistic synthetic network data has broad applications from network simulation to scientific discovery. However, many existing black-box approaches for network generation tend to overfit observed data while overlooking characteristic network structure, and incur substantial computational overhead at scale. These practical challenges call for synthetic network generation methods that are both efficient and capable of capturing structural properties of networks. In this paper, we introduce Synthetic Network Generation via Latent Embedding Reconstruction (SyNGLER), a general and efficient framework for synthetic network generation that builds on latent space network models. Given an observed network, SyNGLER first learns low-dimensional latent node embeddings via a latent space network model and then reconstructs the latent space by building a distribution-free generator over these embeddings. For generation, SyNGLER first samples (or resamples) node embeddings from the generator in the latent space and then produces synthetic networks using the latent space network model. Through the latent space framework, SyNGLER preserves unique characteristics in networks such as sparsity and node degree heterogeneity, while allowing for efficient training with lower computational cost than many existing deep architectures. We provide theoretical guarantees by developing consistency results on the distance between the true and synthetic edge distributions. Empirical studies further demonstrate the effectiveness of SyNGLER, which efficiently produces networks that better preserve key network characteristics such as network moments and degree distributions compared with existing approaches. Code is available at https://github.com/FeifanJiang/syngler.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 37 of its 62 references that are in the map. First posted on arXiv 31 May 2026.
Builds on
37 of 62 references.
References · 37
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2017Graph Attention Networkscited by 8,854
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2021Score-based Generative Modeling in Latent Spacecited by 634
- 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
- 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
- 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
25 more
- 2020Permutation Invariant Graph Generation via Score-Based Generative Modelingcited by 263
- 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
- 2018Learning Deep Generative Models of Graphscited by 227
- 2023Geometric Latent Diffusion Models for 3D Molecule Generationcited by 185
- 2023Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Datacited by 171
- 2019Exploring Randomly Wired Neural Networks for Image Recognitioncited by 103
- 2018Multi-Objective De Novo Drug Design with Conditional Graph Generative Modelcited by 101
- 2015Low-rank Solutions of Linear Matrix Equations via Procrustes Flowcited by 97
- 2023Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modelingcited by 75
- 2017Statistical inference on random dot product graphs: a surveycited by 70
- 2022A Survey on Deep Graph Generation: Methods and Applicationscited by 69
- 2022Diffusion Models for Graphs Benefit From Discrete State Spacescited by 69
- 2019Recurrent Neural Networks (RNNs): A gentle Introduction and Overviewcited by 68
- 2023Generating and Imputing Tabular Data via Diffusion and Flow-based Gradient-Boosted Treescited by 60
- 2022Fast Graph Generation via Spectral Diffusioncited by 36
- 2023Efficient and Scalable Graph Generation through Iterative Local Expansioncited by 35
- 2023A Latent Diffusion Model for Protein Structure Generationcited by 28
- 2024Unifying Generation and Prediction on Graphs with Latent Graph Diffusioncited by 24
- 2023GraphMaker: Can Diffusion Models Generate Large Attributed Graphs?cited by 15
- 2016STORE: Sparse Tensor Response Regression and Neuroimaging Analysiscited by 11
- 2019Bootstrapping Networks with Latent Space Structurecited by 11
- 2013A Scalable Generative Graph Model with Community Structurecited by 10
- 2025Denoising Diffused Embeddings: a Generative Approach for Hypergraphscited by 4
- 2023Statistical Inference on Latent Space Models for Network Datacited by 3
- 2020LOCUS: A Novel Decomposition Method for Brain Network Connectivity Matrices using Low-rank Structure with Uniform Sparsitycited by 1
Built on by
Not cited yet.