Graph Agent: Explicit Reasoning Agent for Graphs
Abstract
Graph embedding methods such as Graph Neural Networks (GNNs) and Graph Transformers have contributed to the development of graph reasoning algorithms for various tasks on knowledge graphs. However, the lack of interpretability and explainability of graph embedding methods has limited their applicability in scenarios requiring explicit reasoning. In this paper, we introduce the Graph Agent (GA), an intelligent agent methodology of leveraging large language models (LLMs), inductive-deductive reasoning modules, and long-term memory for knowledge graph reasoning tasks. GA integrates aspects of symbolic reasoning and existing graph embedding methods to provide an innovative approach for complex graph reasoning tasks. By converting graph structures into textual data, GA enables LLMs to process, reason, and provide predictions alongside human-interpretable explanations. The effectiveness of the GA was evaluated on node classification and link prediction tasks. Results showed that GA reached state-of-the-art performance, demonstrating accuracy of 90.65\
Benchmark Results
Tested on 1 dataset 1 baseline value 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 | |
| 14 | TAPE | 0.9119
±0.0012 best reported | best today: Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment (TMLR 2025) |
| 15 | InstructGLM | 0.9077 | This paper |
| 18 | GA | 0.9065 | This paper |
| 21 | GCN | 0.9004 best reported | best at pub: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 25 | ACM-GCN | 0.8975 | This paper |
| 27 | ACM-Snowball-3 | 0.8960
±0.0160 best reported | best today: Revisiting the Necessity of Graph Learning and Common Graph Benchmarks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 40 | RevGAT | 0.8911 | This paper |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 57 | CoarFormer | 0.8869 | This paper |
| 141 | GraphSAGE | 0.8708
±0.0085 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Large Language Model Meets Graph Neural Network in Knowledge Distillation (AAAI 2024) Difference within reported uncertainty; not counted as underperformance. |
| 171 | GT | 0.8642 | This paper |
| 456 | Graphormer | 0.8262
±0.0012 best reported | best at pub: Language is All a Graph Needs (2023) best today: Toward a Unified Geometry Understanding: Riemannian Diffusion Framework for Graph Generation and Prediction (NeurIPS 2025) |
| 724 | MLP | 0.7768 | |
| 833 | GraphText-ICL | 0.6830 | This paper |
