CS-Agent: LLM-based Community Search via Dual-agent Collaboration
Jiahao Hua, Long Yuan, Qingshuai Feng, Qiang Fan, Shan Huang

TL;DR
This paper introduces CS-Agent, a dual-agent framework that enhances LLM-based community search in graphs through collaborative refinement, significantly improving result quality without additional training.
Contribution
It presents the first application of LLMs to community search and proposes a novel dual-agent system for iterative result refinement in graph analysis.
Findings
CS-Agent improves community detection accuracy.
The framework enhances result stability and robustness.
Experimental results outperform baseline methods.
Abstract
Large Language Models (LLMs) have demonstrated remarkable capabilities in natural language processing tasks, yet their application to graph structure analysis, particularly in community search, remains underexplored. Community search, a fundamental task in graph analysis, aims to identify groups of nodes with dense interconnections, which is crucial for understanding the macroscopic structure of graphs. In this paper, we propose GraphCS, a comprehensive benchmark designed to evaluate the performance of LLMs in community search tasks. Our experiments reveal that while LLMs exhibit preliminary potential, they frequently fail to return meaningful results and suffer from output bias. To address these limitations, we introduce CS-Agent, a dual-agent collaborative framework to enhance LLM-based community search. CS-Agent leverages the complementary strengths of two LLMs acting as Solver and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
