Beyond Individual Mimicry: Constructing Human-Like Social network with Graph-Augmented LLM Agents
Organizations: Cyberspace Security, Beijing University of Posts and Telecommunications · Institute of Software, Chinese Academy of Sciences
Abstract
Driven by large language models (LLMs), social bot can autonomously engage in local interactions, whose human-like behaviors enable them to evade social bot detection. However, while these botnets exhibit realistic local social interactions, they fail to preserve human-like social network. This is because LLM-based bots are graph-unaware and cannot coordinate over global interactions, which makes those botnets vulnerable to graph neural network (GNN)-based detection. To address this limitation, we propose GraphMind, which equips LLM-driven social bots to explicitly learn and fit human-like social network structures. Building on this foundation, we further construct GraphMind-Botnet, a LLM-driven botnet designed to evaluate the performance of existing social bot detection algorithms. Experiments on datasets derived from GraphMind-Botnet show that both text-based and graph-based detection models show substantially degraded performance in distinguishing. Our results highlight the critical role of social link construction in LLM-driven social network generation, while exposing fundamental weaknesses in existing bot detection mechanisms.
Figures & tables
| Human | Bot | Edges | Edge Types | Communities |
| 1,000 | 1000 | 41375 | 5 | 50 |
| Dataset | Metric | Metadata-based | Text-based | Homo-GNN | Heter-GNN | ||||||
| AB | RF | DT | SVM | Wei et al. | GCN | GAT | BotRGCN | RGT | S-HGN | ||
| Cresci-15 | Acc | 96.9 | 96.0 | 94.7 | 95.4 | 94.78 | 98.2 | 97.7 | 96.3 | 97.2 | 96.9 |
| F1 | 95.5 | 95.6 | 94.6 | 95.3 | 84.25 | 96.0 | 97.0 | 96.3 | 96.5 | 95.9 | |
| Cresci-17 | Acc | 93.2 | 88.1 | 86.2 | 85.1 | 86.30 | / | / | / | / | / |
| F1 | 83.4 | 78.9 | 79.4 | 76.8 | 79.40 | / | / | / | / | / | |
| Twibot-20 | Acc | 85.9 | 85.4 | 81.1 | 85.7 | 78.26 | 76.8 | 83.2 | 86.8 | 87.4 | 85.9 |
| Methods | S-HGN | BotRGCN | RGT | |||
| Acc | F1 | Acc | F1 | Acc | F1 | |
| All | ||||||
| Qwen3-1.7B | 70.7 | 60.5 | 72.4 | 67.6 | 73.5 | 65.8 |
| Qwen3-8B | 69.1 | 68.4 | 70.5 | 62.6 | 69.6 | 65.3 |
| w/o FIM | ||||||
| Qwen3-1.7B | 78.9 | 69.5 | 79.8 | 74.2 | 80.5 | 73.1 |
Appendix figures & tables12 assets
Supplementary material from the paper’s appendix.
Appendix
| Level | Definition |
| Level 1 (Support clique) | Strongest ties; |
| frequent contact | |
| Level 2 (Sympathy group) | Close ties; frequent but |
| not weekly contact | |
| Level 3 (Affinity group) | Casual ties; |
| occasional contact |
| Hyperparameter | Value |
| Optimizer | AdamW |
| Learning rate | |
| Training epochs | 5 |
| LR scheduler | Cosine |
| Warmup steps | 100 |
| Random seed | 42 |
| Hyperparameter | Value |
| Optimizer | AdamW |
| Learning rate | |
| Training epochs | 5 |
| LR scheduler | Cosine |
| Warmup steps | 100 |
| Random seed | 42 |
| Field | Content |
| Instruction | You are an expert in social media behavior analysis. Your task is to infer the social relationship level between two users from an ego-network perspective, and then generate a list of interaction actions that follow realistic behavioral patterns. Follow the steps below: Step 1: Infer the most plausible social relationship level within the ego network. Step 2: Based on the inferred relationship strength, determine the expected interaction intensity and cost. |
| Input | <user_profile> : {PROFILE} <tweets> : {TWEETS} |
| Think | The target user belongs to my ego network with relationship level {RELATIONSHIP_LEVEL}. Based on this relationship strength and the observed profile and interaction context, I infer appropriate interaction intensity and engagement patterns. |
| Output | A list of interaction actions in the following structured format: <action> <type> like / retweet / comment / follow </type> <tweet_id> {TWEET_ID} </tweet_id> |
| Field | Content |
| Instruction | You are an expert in social media behavior analysis. Given a source node and a target node, generate a multi-hop following path based on the input social network structure. First, select a set of potential intermediate nodes from the given network, and then predict and generate potential social links according to their profile information. Follow the steps below: Step 1: Select candidate intermediate nodes from the input graph based on profile similarity to the source node. Step 2: Sequentially infer plausible following relationships between adjacent nodes to form a multi-hop path. Requirements: 1. The path must contain hops (Source Mediator 1 Mediator 2 Target). 2. All mediator nodes must be selected from the given network information. 3. Path inference must be based on feature similarities (bio, age, education, location, etc.). 4. The connection rationale must be analyzed for each hop. |
| Input | <graph> <nodes> {users} </nodes> <edges> {follow_edges} </edges> </graph> <source_node> {user_A} </source_node> <target_node> {user_B} </target_node> |
| Think | <think> [Link 1] <user>1</user> follow <user>2</user> <reason>...</reason> [Link ..] </think> |
| Output | Based on the analysis of user profiles and social relationships, the most plausible multi-hop following path is: user_A mediator_1 mediator_2 user_B . |