Efficient Synthetic Network Generation via Latent Embedding Reconstruction
Feifan Jiang, Yinan Bu, Shihao Wu, Gongjun Xu, Ji Zhu
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 945e19e7-0aa4-480b-addc-e1822f6eb326Builds on12
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- High-Resolution Image Synthesis with Latent Diffusion ModelsRobin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser et al.CVPR 2022 · 13,123 citations
- Score-Based Generative Modeling through Stochastic Differential EquationsYang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar et al.ICLR 2021 · 1,270 citations
- Score-based Generative Modeling in Latent SpaceArash Vahdat, Karsten Kreis, Jan KautzNeurIPS 2021 · 903 citations
- Exploring Randomly Wired Neural Networks for Image RecognitionSaining Xie, Alexander Kirillov, Ross B. Girshick, Kaiming HeICCV 2019 · 384 citations
Related papers
- ReLaSH: Reconstructing Joint Latent Spaces for Efficient Generation of Synthetic Hypergraphs with Hyperlink AttributesFeiyan Ma, Shihao Wu, Gongjun Xu, Ji ZhuICLR 2026
- Efficient Learning-based Community-Preserving Graph GenerationSheng Xiang, Dawei Cheng, Jianfu Zhang, Zhenwei Ma et al.ICDE 2022 · 8 citations
- Multi-resolution Spectral Coherence for Graph Generation with Score-based DiffusionHyuna Cho, Minjae Jeong, Sooyeon Jeon, Sungsoo Ahn et al.NeurIPS 2023 · 12 citations
- Deep Latent Graph MatchingTianshu Yu, Runzhong Wang, Junchi Yan, Baoxin LiICML 2021 · 21 citations
- FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation ModelChaokun Wang, Binbin Wang, Bingyang Huang, Shaoxu Song et al.ICDE 2021 · 10 citations
