Efficient Synthetic Network Generation via Latent Embedding Reconstruction

• URL: http://arxiv.org/abs/2606.00934v1
• Date: Sun, 31 May 2026 00:01:13 GMT
• Title: Efficient Synthetic Network Generation via Latent Embedding Reconstruction
• Abstract summary: We introduce Synthetic Network Generation via Latent Embedding Reconstruction (SyNGLER), a framework for synthetic network generation that builds on latent space network models.<n>SyNGLER preserves unique characteristics in networks such as sparsity and node degree heterogeneity.<n>We provide theoretical guarantees by developing consistency results on the distance between the true and synthetic edge distributions.
• Score: 5.202384944712403
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• A Network Science Perspective on Evaluating Deep Graph Generative Models [1.1515813571394018]
  Deep graph generative models learn complex structural distributions directly from real-world networks to generate more realistic synthetic networks.<n>Because real social contact networks cannot be shared due to privacy risks, synthetic networks serve as an alternative for developing and evaluating epidemic mitigation strategies.<n>It is found that two deep graph generative models produce synthetic networks that closely resemble the structural properties of real-world networks, enabling them to identify effective immunization strategies.
  arXiv  Detail & Related papers  (2026-09-01T10:06:13Z)
• GUIDED Network-Agnostic Feature Initialization for Spatial Transferability in GNN-based Models [46.28228608289378]
  The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.<n>This research proposes a network-agnostic initialization layer, termed Geometrically Unconstrained Inductive Demand EmbeDding.<n>This framework standardizes the input space regardless of network scale.<n>It provides a versatile blueprint for generalized origin-destination spatial problems, such as freight logistics and multimodal network optimization.
  arXiv  Detail & Related papers  (2026-07-21T16:41:59Z)
• Synthetic generation of online social networks through homophily [44.05636851266385]
  This work proposes a homophily-based algorithm that produces synthetic microblogging social networks such as X.<n>The framework is validated by generating synthetic OSNs at four scales (103-106 nodes), and benchmarking them against a real-world Bluesky network comprising 4 million users.
  arXiv  Detail & Related papers  (2025-09-02T19:09:08Z)
• PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis [75.14189839277928]
  We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
  arXiv  Detail & Related papers  (2025-08-29T01:47:27Z)
• Symbolic Regression of Dynamic Network Models [0.0]
  We introduce a novel formulation of a network generator and a parameter-free fitness function to evaluate the generated network. We extend this approach by modifying generator semantics to create and retrieve rules for time-varying networks. The framework was then used on three empirical datasets - subway networks of major cities, regions of street networks and semantic co-occurrence networks of literature in Artificial Intelligence.
  arXiv  Detail & Related papers  (2023-12-15T00:34:45Z)
• Riemannian Residual Neural Networks [58.925132597945634]
  We show how to extend the residual neural network (ResNet) ResNets have become ubiquitous in machine learning due to their beneficial learning properties, excellent empirical results, and easy-to-incorporate nature when building varied neural networks.
  arXiv  Detail & Related papers  (2023-10-16T02:12:32Z)
• Contextualizing MLP-Mixers Spatiotemporally for Urban Data Forecast at Scale [54.15522908057831]
  We propose an adapted version of the computationally-Mixer for STTD forecast at scale. Our results surprisingly show that this simple-yeteffective solution can rival SOTA baselines when tested on several traffic benchmarks. Our findings contribute to the exploration of simple-yet-effective models for real-world STTD forecasting.
  arXiv  Detail & Related papers  (2023-07-04T05:19:19Z)
• Realistic Synthetic Social Networks with Graph Neural Networks [1.8275108630751837]
  We evaluate the potential of Graph Neural Network (GNN) models for network generation for synthetic social networks. We include social network specific measurements which allow evaluation of how realistically synthetic networks behave. We find that the Gated Recurrent Attention Network (GRAN) extends well to social networks, and in comparison to a benchmark popular rule-based generation Recursive-MATrix (R-MAT) method, is better able to replicate realistic structural dynamics.
  arXiv  Detail & Related papers  (2022-12-15T14:04:27Z)
• BScNets: Block Simplicial Complex Neural Networks [79.81654213581977]
  Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning. We present Block Simplicial Complex Neural Networks (BScNets) model for link prediction. BScNets outperforms state-of-the-art models by a significant margin while maintaining low costs.
  arXiv  Detail & Related papers  (2021-12-13T17:35:54Z)
• Synthetic Active Distribution System Generation via Unbalanced Graph Generative Adversarial Network [2.2749157557381245]
  An implicit generative model with Wasserstein GAN objectives is designed to generate synthetic three-phase unbalanced active distribution system connectivity. The basic idea is to learn the distribution of random walks both over a real-world system and across each phase of line segments. Case studies with several power applications demonstrate that synthetic active networks generated by the proposed framework can mimic almost all features of real-world networks.
  arXiv  Detail & Related papers  (2021-08-02T02:17:01Z)
• Clustered Federated Learning via Generalized Total Variation Minimization [83.26141667853057]
  We study optimization methods to train local (or personalized) models for local datasets with a decentralized network structure. Our main conceptual contribution is to formulate federated learning as total variation minimization (GTV) Our main algorithmic contribution is a fully decentralized federated learning algorithm.
  arXiv  Detail & Related papers  (2021-05-26T18:07:19Z)
• Network Embedding via Deep Prediction Model [25.727377978617465]
  This paper proposes a network embedding framework to capture the transfer behaviors on structured networks via deep prediction models. A network structure embedding layer is added into conventional deep prediction models, including Long Short-Term Memory Network and Recurrent Neural Network. Experimental studies are conducted on various datasets including social networks, citation networks, biomedical network, collaboration network and language network.
  arXiv  Detail & Related papers  (2021-04-27T16:56:00Z)
• Firefly Neural Architecture Descent: a General Approach for Growing Neural Networks [50.684661759340145]
  Firefly neural architecture descent is a general framework for progressively and dynamically growing neural networks. We show that firefly descent can flexibly grow networks both wider and deeper, and can be applied to learn accurate but resource-efficient neural architectures. In particular, it learns networks that are smaller in size but have higher average accuracy than those learned by the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-17T04:47:18Z)
• The Heterogeneity Hypothesis: Finding Layer-Wise Differentiated Network Architectures [179.66117325866585]
  We investigate a design space that is usually overlooked, i.e. adjusting the channel configurations of predefined networks. We find that this adjustment can be achieved by shrinking widened baseline networks and leads to superior performance. Experiments are conducted on various networks and datasets for image classification, visual tracking and image restoration.
  arXiv  Detail & Related papers  (2020-06-29T17:59:26Z)
• Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN [16.362525151483084]
  We propose a novel dynamic heterogeneous network embedding method, termed as DyHATR. It uses hierarchical attention to learn heterogeneous information and incorporates recurrent neural networks with temporal attention to capture evolutionary patterns. We benchmark our method on four real-world datasets for the task of link prediction.
  arXiv  Detail & Related papers  (2020-04-01T17:16:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.