Demystifying the Power of Large Language Models in Graph Structure Generation

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Despite the unprecedented success of applying Large Language Models (LLMs) to graph discriminative tasks such as node classification and link prediction, its potential for graph structure generation remains largely unexplored. To fill this crucial gap, this paper presents a systematic investigation into the capability of LLMs for graph structure generation. Specifically, we design prompts triggering LLMs to generate codes that optimize network properties by injecting domain expertise from network science. Since graphs in different domains exhibit unique structural properties captured by various metrics (e.g., clustering coefficient capturing triangles in social networks while squares reflecting road segments in transportation networks), we first evaluate the capability of LLMs to generate graphs satisfying each structural property in different domains. After that, we select the optimal property configurations and benchmark the graph structure generation performance of LLMs against established graph generative models across multiple domains. Our findings shed light on generating graph structures from an LLM perspective. Our code is publically available here.

Cite

CITATION STYLE

APA

Wang, Y., Rossi, R., Park, N., Ahmed, N., Koutra, D., Dernoncourt, F., & Derr, T. (2025). Demystifying the Power of Large Language Models in Graph Structure Generation. In 2025 Annual Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Proceedings of the Conference Findings, NAACL 2025 (pp. 8189–8204). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2025.findings-naacl.456

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free