Are Large Language Models Good Temporal Graph Learners?

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Huang, Shenyang, Parviz, Ali, Kondrup, Emma, Yang, Zachary, Ding, Zifeng, Bronstein, Michael, Rabbany, Reihaneh, Rabusseau, Guillaume
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908395380932608
author Huang, Shenyang
Parviz, Ali
Kondrup, Emma
Yang, Zachary
Ding, Zifeng
Bronstein, Michael
Rabbany, Reihaneh
Rabusseau, Guillaume
author_facet Huang, Shenyang
Parviz, Ali
Kondrup, Emma
Yang, Zachary
Ding, Zifeng
Bronstein, Michael
Rabbany, Reihaneh
Rabusseau, Guillaume
contents Large Language Models (LLMs) have recently driven significant advancements in Natural Language Processing and various other applications. While a broad range of literature has explored the graph-reasoning capabilities of LLMs, including their use of predictors on graphs, the application of LLMs to dynamic graphs -- real world evolving networks -- remains relatively unexplored. Recent work studies synthetic temporal graphs generated by random graph models, but applying LLMs to real-world temporal graphs remains an open question. To address this gap, we introduce Temporal Graph Talker (TGTalker), a novel temporal graph learning framework designed for LLMs. TGTalker utilizes the recency bias in temporal graphs to extract relevant structural information, converted to natural language for LLMs, while leveraging temporal neighbors as additional information for prediction. TGTalker demonstrates competitive link prediction capabilities compared to existing Temporal Graph Neural Network (TGNN) models. Across five real-world networks, TGTalker performs competitively with state-of-the-art temporal graph methods while consistently outperforming popular models such as TGN and HTGN. Furthermore, TGTalker generates textual explanations for each prediction, thus opening up exciting new directions in explainability and interpretability for temporal link prediction. The code is publicly available at https://github.com/shenyangHuang/TGTalker.
format Preprint
id arxiv_https___arxiv_org_abs_2506_05393
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Are Large Language Models Good Temporal Graph Learners?
Huang, Shenyang
Parviz, Ali
Kondrup, Emma
Yang, Zachary
Ding, Zifeng
Bronstein, Michael
Rabbany, Reihaneh
Rabusseau, Guillaume
Computation and Language
Machine Learning
Large Language Models (LLMs) have recently driven significant advancements in Natural Language Processing and various other applications. While a broad range of literature has explored the graph-reasoning capabilities of LLMs, including their use of predictors on graphs, the application of LLMs to dynamic graphs -- real world evolving networks -- remains relatively unexplored. Recent work studies synthetic temporal graphs generated by random graph models, but applying LLMs to real-world temporal graphs remains an open question. To address this gap, we introduce Temporal Graph Talker (TGTalker), a novel temporal graph learning framework designed for LLMs. TGTalker utilizes the recency bias in temporal graphs to extract relevant structural information, converted to natural language for LLMs, while leveraging temporal neighbors as additional information for prediction. TGTalker demonstrates competitive link prediction capabilities compared to existing Temporal Graph Neural Network (TGNN) models. Across five real-world networks, TGTalker performs competitively with state-of-the-art temporal graph methods while consistently outperforming popular models such as TGN and HTGN. Furthermore, TGTalker generates textual explanations for each prediction, thus opening up exciting new directions in explainability and interpretability for temporal link prediction. The code is publicly available at https://github.com/shenyangHuang/TGTalker.
title Are Large Language Models Good Temporal Graph Learners?
topic Computation and Language
Machine Learning
url https://arxiv.org/abs/2506.05393