arXiv Machine Learning By Feifan Jiang, Yinan Bu, Shihao Wu, Gongjun Xu, Ji Zhu

Efficient Synthetic Network Generation via Latent Embedding Reconstruction

Read the original on arXiv Machine Learning →

arXiv:2606. 00934v1 Announce Type: cross Abstract: Network data are ubiquitous across the social sciences, biology, and information systems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 20

GraphK: Variable-Size Graph Generation with Efficient Edge Construction

GraphK introduces an encoder‑sampler‑decoder framework that generates variable‑size graphs efficiently. It learns permutation‑invariant latent representations and samples new node embeddings via maximum likelihood, enabling both upscaling and downscaling of graph size. Edge construction uses KDTree‑based top‑k neighbor search in latent space, reducing computational cost while capturing graph properties.

By Resul Tugay, Eren Olu\u{g}, Elif Ak, Sule Gunduz Oguducu
arXiv Machine Learning
Sep 11

SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking

SynCo is a synthetic graph generator that lets users control node degree distributions and sub‑community structures, addressing limitations of existing generators that rely on power‑law distributions and lack flexibility. It is evaluated on graph mimicking, hyperparameter tuning, and node clustering, outperforming state‑of‑the‑art methods while preserving original data distributions. SynCo can generate large graphs with up to 2.1 million nodes.

By Guilherme Henrique Messias, Mariana Caravanti de Souza, Sylvia Iasulaitis, Alan Dem\'etrius Baria Valejo
arXiv Machine Learning
Sep 24

Variational Bayesian Flow Network for Graph Generation

The paper introduces Variational Bayesian Flow Network (VBFN), a graph generation model that lifts Bayesian updates to a joint Gaussian belief family with structured precisions, enabling coupled node and edge updates in a single fusion step. By constructing sample‑agnostic sparse precisions from a representation‑induced dependency graph, VBFN avoids label leakage while enforcing node‑edge consistency. Experiments on synthetic and molecular graph datasets show that VBFN improves fidelity and diversity over baseline methods.

By Yida Xiong, Jiameng Chen, Xiuwen Gong, Jia Wu, Shirui Pan, Wenbin Hu