Feature-Enhanced Graph Neural Networks for Classification of Synthetic Graph Generative Models: A Benchmarking Study
Janek Dyer, Jagdeep Ahluwalia, Javad Zarrin

TL;DR
This study evaluates hybrid graph neural network models combined with engineered features for classifying diverse synthetic graph models, achieving high accuracy and providing insights into model performance and interpretability.
Contribution
It introduces a comprehensive benchmarking of GNN architectures with graph-theoretic features on a large synthetic dataset for graph classification.
Findings
GraphSAGE and GTN achieved 98.5% accuracy
Hybrid models outperform baseline SVM
GAT models showed limitations in global structure capture
Abstract
The ability to discriminate between generative graph models is critical to understanding complex structural patterns in both synthetic graphs and the real-world structures that they emulate. While Graph Neural Networks (GNNs) have seen increasing use to great effect in graph classification tasks, few studies explore their integration with interpretable graph theoretic features. This paper investigates the classification of synthetic graph families using a hybrid approach that combines GNNs with engineered graph-theoretic features. We generate a large and structurally diverse synthetic dataset comprising graphs from five representative generative families, Erdos-Renyi, Watts-Strogatz, Barab'asi-Albert, Holme-Kim, and Stochastic Block Model. These graphs range in size up to 1x10^4 nodes, containing up to 1.1x10^5 edges. A comprehensive range of node and graph level features is extracted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Big Data and Digital Economy
