LLM-Based Multi-Agent Systems are Scalable Graph Generative Models

📅 2024-10-13
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Existing social graph generation methods face a fundamental trade-off: rule-based approaches lack realism and generalizability, while deep learning–based methods require extensive labeled data and struggle with large-scale, dynamic modeling. To address this, we propose GraphAgent-Generator (GAG), the first framework to leverage large language models (LLMs) as zero-shot, scalable graph generators—exploiting their inherent sociocultural commonsense knowledge via multi-agent collaborative simulation for dynamic, fine-grained, text-attributed social graph generation. GAG is the first method to simultaneously satisfy seven macroscopic network properties and achieve high-fidelity microscopic structure in a zero-shot setting. It improves structural graph metrics by 11%, scales to graphs with up to 100K nodes and 1M edges, and achieves a parallel speedup of 90.4×. Node classification experiments empirically confirm strong alignment between textual semantics and graph topology.

Technology Category

Application Category

📝 Abstract
The structural properties of naturally arising social graphs are extensively studied to understand their evolution. Prior approaches for modeling network dynamics typically rely on rule-based models, which lack realism and generalizability, or deep learning-based models, which require large-scale training datasets. Social graphs, as abstract graph representations of entity-wise interactions, present an opportunity to explore network evolution mechanisms through realistic simulations of human-item interactions. Leveraging the pre-trained social consensus knowledge embedded in large language models (LLMs), we present GraphAgent-Generator (GAG), a novel simulation-based framework for dynamic, text-attributed social graph generation. GAG simulates the temporal node and edge generation processes for zero-shot social graph generation. The resulting graphs exhibit adherence to seven key macroscopic network properties, achieving an 11% improvement in microscopic graph structure metrics. Through the node classification benchmarking task, we validate GAG effectively captures the intricate text-structure correlations in graph generation. Furthermore, GAG supports generating graphs with up to nearly 100,000 nodes or 10 million edges through large-scale LLM-based agent simulation with parallel acceleration, achieving a minimum speed-up of 90.4%. The source code is available at https://github.com/Ji-Cather/GraphAgent.
Problem

Research questions and friction points this paper is trying to address.

Social Graph Modeling
Rule-based Approaches
Deep Learning Limitations
Innovation

Methods, ideas, or system contributions that make the work stand out.

GraphAgent-Generator
Dynamic Social Graph Generation
Efficient Large-scale Modeling
J
Jiarui Ji
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
Runlin Lei
Runlin Lei
Renmin University of China
Graph Neural NetworksGraph Adversarial Attacks and Defense
J
Jialing Bi
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
Zhewei Wei
Zhewei Wei
Renmin University of China
Graph AlgorithmsStreaming AlgorithmsAI4ScienceAI4DB
X
Xu Chen
Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China
Yankai Lin
Yankai Lin
Associate Professor (Tenure Track), Gaoling School of AI, Renmin University of China
Natural Language ProcessingLarge Language Models
X
Xuchen Pan
Alibaba Group
Yaliang Li
Yaliang Li
Alibaba Group
Machine Learning
Bolin Ding
Bolin Ding
Alibaba Group
DatabasesData PrivacyMachine Learning