{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/can-large-language-models-analyze-graphs-like","title":"Can Large Language Models Analyze Graphs like Professionals? A Benchmark, Datasets and Models","arxiv_id":"2409.19667","date":"2024-09-29","proceeding":null,"authors":["Xin Li","Weize Chen","Qizhi Chu","Haopeng Li","Zhaojun Sun","Ran Li","Chen Qian","Yiwei Wei","Zhiyuan Liu","Chuan Shi","Maosong Sun","Cheng Yang"],"abstract":"The need to analyze graphs is ubiquitous across various fields, from social networks to biological research and recommendation systems. Therefore, enabling the ability of large language models (LLMs) to process graphs is an important step toward more advanced general intelligence. However, current LLM benchmarks on graph analysis require models to directly reason over the prompts describing graph topology, and are thus limited to small graphs with only a few dozens of nodes. In contrast, human experts typically write programs based on popular libraries for task solving, and can thus handle graphs with different scales. To this end, a question naturally arises: can LLMs analyze graphs like professionals? In this paper, we introduce ProGraph, a manually crafted benchmark containing 3 categories of graph tasks. The benchmark expects solutions based on programming instead of directly reasoning over raw inputs. Our findings reveal that the performance of current LLMs is unsatisfactory, with the best model achieving only 36% accuracy. To bridge this gap, we propose LLM4Graph datasets, which include crawled documents and auto-generated codes based on 6 widely used graph libraries. By augmenting closed-source LLMs with document retrieval and fine-tuning open-source ones on the codes, we show 11-32% absolute improvements in their accuracies. Our results underscore that the capabilities of LLMs in handling structured data are still under-explored, and show the effectiveness of LLM4Graph in enhancing LLMs' proficiency of graph analysis. The benchmark, datasets and enhanced open-source models are available at https://github.com/BUPT-GAMMA/ProGraph.","url_abs":"https://arxiv.org/abs/2409.19667v2","url_pdf":"https://arxiv.org/pdf/2409.19667v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"can-large-language-models-analyze-graphs-like","repo_url":"https://github.com/bupt-gamma/prograph","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"can-large-language-models-analyze-graphs-like","repo_url":"https://github.com/bupt-gamma/graphteam","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2409.19667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19667"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/BUPT-GAMMA/ProGraph","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/bupt-gamma/graphteam","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/bupt-gamma/prograph","reach":{"status":"ok"}}],"summary":{"ran":1,"unverified":4},"by_repo_kind":{"listed":{"samples":5,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"74593dd3a030965d","entry":"check_bool","repo":"bupt-gamma/graphteam","repo_kind":"listed","path":"multi-agents-4-graph-analysis/GraphTeam/graphteam/chat_chain.py","file_url":"https://github.com/bupt-gamma/graphteam/blob/HEAD/multi-agents-4-graph-analysis/GraphTeam/graphteam/chat_chain.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"74593dd3a030965d"}},{"code_sha256_prefix":"77d746c4da984457","entry":"extract_code","repo":"bupt-gamma/graphteam","repo_kind":"listed","path":"multi-agents-4-graph-analysis/GraphTeam/camel/agents.py","file_url":"https://github.com/bupt-gamma/graphteam/blob/HEAD/multi-agents-4-graph-analysis/GraphTeam/camel/agents.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"77d746c4da984457"}},{"code_sha256_prefix":"92b2c63686261b0f","entry":"find_detailed_info_by_ids","repo":"bupt-gamma/graphteam","repo_kind":"listed","path":"multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","file_url":"https://github.com/bupt-gamma/graphteam/blob/HEAD/multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"92b2c63686261b0f"}},{"code_sha256_prefix":"c1e532b07878a081","entry":"parse_raw_text_to_dict_memory","repo":"bupt-gamma/graphteam","repo_kind":"listed","path":"multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","file_url":"https://github.com/bupt-gamma/graphteam/blob/HEAD/multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c1e532b07878a081"}},{"code_sha256_prefix":"4c6ca6aa6f4fd281","entry":"select_by_accuracy","repo":"bupt-gamma/graphteam","repo_kind":"listed","path":"multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","file_url":"https://github.com/bupt-gamma/graphteam/blob/HEAD/multi-agents-4-graph-analysis/GraphTeam/memory/get_result_from_memory.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4c6ca6aa6f4fd281"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}