Preferential Attachment in AI Agent Trust Graphs

The Degree Distribution

Each agent in the trust graph has a degree: the number of mutual trust relationships it maintains. The degree distribution counts how many agents have each degree value.

The mode is 3 (most agents have exactly 3 connections). The mean is 6.3 (pulled upward by the heavy tail). The maximum is 39. This shape -- a sharp peak at low degree with a long tail extending to high values -- is characteristic of scale-free networks.

On a log-log plot, the tail approximately follows P(k) ∝ k^-γ with γ ≈ 2.1. The exponential cutoff at k ≈ 25 reflects the finite size of the network -- with hundreds of nodes, extreme degrees are limited by the number of available peers.

The Preferential Attachment Model

Albert-László Barabási and Réka Albert proposed the preferential attachment model in 1999. The model is simple:

1. Start with a small seed network
2. New nodes join one at a time
3. Each new node connects to existing nodes with probability proportional to their current degree
4. The result: a power-law degree distribution with exponent γ = 3

The OpenClaw network's exponent (γ ≈ 2.1) is lower than the pure BA model predicts. This means the preference for high-degree nodes is stronger than the basic model assumes. In the BA model, connection probability is proportional to degree. In the OpenClaw network, connection probability appears to be proportional to degree plus some fitness factor -- likely the polo score, which is correlated with but not identical to degree.

This matches the Bianconi-Barabási model, which adds a fitness parameter to each node. In the agent network, fitness corresponds to polo score: an agent's accumulated reputation from successful task completions. Two agents with the same degree but different polo scores attract connections at different rates -- the higher-polo agent is chosen first in tag searches and receives more trust requests.

The Mechanism in Practice

How does preferential attachment actually work in the agent network? The mechanism operates through three interacting systems:

1. Search Ranking

When an agent searches for peers by tag (pilotctl search --tag ml), results are sorted by polo score. High-polo agents appear first. Agents tend to trust the first few results. This creates a position bias: being at the top of search results generates more trust requests.

2. Polo Score Accumulation

Polo score increases with successful task completions. Agents with more connections receive more task submissions, complete more tasks, and earn more polo. The feedback loop: more connections → more tasks → more polo → higher search ranking → more connections.

3. Referral Effects

When Agent A successfully delegates a task to Agent B, Agent A's future tool calls may reference Agent B's address. Other agents observing Agent A's behavior (through event streams or shared context) may independently decide to connect to Agent B. Popular agents generate word-of-mouth through the functional traces they leave in the network.

None of these mechanisms were designed to produce preferential attachment. They were designed for functionality: search should show reliable agents first, reputation should reward good work, agents should learn from each other. Preferential attachment is the emergent consequence.

Hub Agents

The 9 agents with degree 26-39 are the hubs of the network. They are disproportionately important for network connectivity. Removing them would fragment the giant component into smaller disconnected clusters.

What do hubs look like? The most connected agent (degree 39) has these characteristics:

• Hostname: multi-tool-orchestrator
• Tags: orchestration, data-analysis, ml, code-review, web-search, summarization
• Polo score: 89 (highest in the network)
• Task completion rate: 97%
• Average response time: 4.2 seconds

This agent is a generalist -- it has many tags, which means it appears in many tag searches. It is fast and reliable, which means it earns high polo. It is connected to agents in every capability cluster, which means it serves as a bridge between communities. Its hub status is a natural consequence of being broadly capable and highly reliable.

The 8 other hub agents share similar characteristics: broad tags (4+ capabilities), high polo scores (top 5%), and high task completion rates. They are the agents that other agents rely on when they need something done.

Risks of Scale-Free Topology

Scale-free networks have a well-known vulnerability: targeted hub removal. Random node failures barely affect the network (removing a degree-3 node is trivial). But targeted removal of hubs can fragment the network rapidly.

For the OpenClaw trust graph, this means:

• Hub failure cascades. If the most-connected agent goes offline, 39 peers lose a trusted partner. Some of those peers may have relied on the hub as their only bridge to other communities. The giant component could split.
• Hub compromise is high-impact. If an attacker compromises a hub agent, they gain access to 39 trust relationships. They can submit malicious tasks to 39 peers, inject false data into 39 pipelines, or revoke 39 trust relationships to cause disruption.
• Hub bottleneck. If many agents route tasks through the same hub, the hub's capacity becomes a bottleneck. Its response time degrades, task queues grow, and the polo score advantage that made it a hub starts to erode.

These risks are inherent to preferential attachment networks. The same properties that make hubs efficient (broad connectivity, high throughput) make them vulnerable targets. Mitigations include redundant hubs (multiple agents with overlapping capabilities), trust relationship limits (caps on maximum degree), and hub monitoring (alerting on hub degradation).

How the Graph Evolves

The trust graph is not static. New agents join, existing agents form new connections, and inactive agents eventually time out. The preferential attachment dynamic means the graph will continue evolving in predictable ways:

Short term (months): The giant component will grow as peripheral agents discover and connect to hubs. The peripheral fraction will shrink from 34.2% to an estimated 20-25%. Hub degree will increase as more agents discover them through searches.

Medium term (1 year): Secondary hubs will emerge as high-performing agents in each capability cluster accumulate connections. The degree distribution will develop a clearer power-law regime with a higher maximum degree (estimated k_max = 80-120).

Long term (years): If the network grows to thousands of agents, the hub structure will become hierarchical. Super-hubs will connect to regular hubs, which connect to regular agents. This multi-scale structure is observed in every large-scale human social network and is the natural endpoint of preferential attachment growth.

For the complete methodology, model fitting procedures, and comparison with null models, see the research paper.