GraphText: Graph Reasoning in Text Space
Abstract
Large Language Models (LLMs) have gained the ability to assimilate human knowledge and facilitate natural language interactions with both humans and other LLMs. However, despite their impressive achievements, LLMs have not made significant advancements in the realm of graph machine learning. This limitation arises because graphs encapsulate distinct relational data, making it challenging to transform them into natural language that LLMs understand. In this paper, we bridge this gap with a novel framework, GraphText, that translates graphs to natural language. GraphText derives a graph-syntax tree for each graph that encapsulates both the node attributes and inter-node relationships. Traversal of the tree yields a graph text sequence, which is then processed by an LLM to treat graph tasks as text generation tasks. Notably, GraphText offers multiple advantages. It introduces training-free graph reasoning: even without training on graph data, GraphText with ChatGPT can achieve on par with, or even surpassing, the performance of supervised-trained graph neural networks through in-context learning (ICL). Furthermore, GraphText paves the way for interactive graph reasoning, allowing both humans and LLMs to communicate with the model seamlessly using natural language. These capabilities underscore the vast, yet-to-be-explored potential of LLMs in the domain of graph machine learning.
Benchmark Results
Tested on 5 datasets 14 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 45 | GCNII | 0.8893
±0.0137 best reported | best at pub: Language is All a Graph Needs (2023) best today: Large Language Model Meets Graph Neural Network in Knowledge Distillation (AAAI 2024) |
| 303 | GATv2 | 0.8406
±0.0083 best reported | |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 36 | GCNII | 0.8076
±0.0030 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 | |
| 350 | MLP | 0.7289
±0.0010 | |
| 585 | GATv2 | 0.7060 best reported |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 70 | GCNII | 0.8918
±0.0443 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Piecewise Constant Spectral Graph Neural Network (TMLR 2025) |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) |
| 258 | GATv2 | 0.7929
±0.0403 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 35 | GCNII | 0.8918
±0.0396 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 138 | SAGE | 0.8269 | |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 177 | GATv2 | 0.8033
±0.0333 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DMD++ | 0.9190
±0.0260 | |
| 2 | F-GREAD-BS | 0.9059
±0.0380 | |
| 3 | APPNP | 0.9010
±0.0350 | |
| 37 | MLP | 0.8629
±0.0450 | |
| 53 | GAT | 0.8430
±0.0370 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 63 | GCN | 0.8310
±0.0320 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 69 | GraphSAGE | 0.8118
±0.0556 | |
| 75 | GCNII | 0.8039
±0.0340 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Graph Navier–Stokes Networks (2026) |
| 84 | GATv2 | 0.7910
±0.0200 best reported | best today: What Can We Learn From MIMO Graph Convolutions? (IJCAI 2025) |
