Pith. sign in

REVIEW 1 cited by

Synthetic Graph Generation to Benchmark Graph Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.01376 v1 pith:5DGR27GQ submitted 2022-04-04 cs.LG cs.SI

Synthetic Graph Generation to Benchmark Graph Learning

classification cs.LG cs.SI
keywords graphalgorithmslearningsyntheticallowsbenchmarkdatasetsinsight
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Graph learning algorithms have attained state-of-the-art performance on many graph analysis tasks such as node classification, link prediction, and clustering. It has, however, become hard to track the field's burgeoning progress. One reason is due to the very small number of datasets used in practice to benchmark the performance of graph learning algorithms. This shockingly small sample size (~10) allows for only limited scientific insight into the problem. In this work, we aim to address this deficiency. We propose to generate synthetic graphs, and study the behaviour of graph learning algorithms in a controlled scenario. We develop a fully-featured synthetic graph generator that allows deep inspection of different models. We argue that synthetic graph generations allows for thorough investigation of algorithms and provides more insights than overfitting on three citation datasets. In the case study, we show how our framework provides insight into unsupervised and supervised graph neural network models.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Community detection robustness of graph neural networks

    cs.SI 2025-09 unverdicted novelty 5.0

    Supervised GNNs show higher baseline accuracy on community detection while unsupervised ones like DMoN prove more resilient to attribute shifts, edge deletions, and adversarial perturbations, with stronger communities...