Graph Engineering Isn't About More Connections — It's About Which Ones Get Used
A controlled experiment isolating relationship density (the ratio of actual to possible communication edges) in an 8-agent multi-agent system found that higher connectivity does not improve performance — recovery rates stayed flat across all density levels. As network density increased, agents used a shrinking fraction of available communication edges, suggesting that raw pathway count is a poor proxy for effective information flow. The experiment used a fully deterministic agent policy (TF-IDF-
Analysis
TL;DR
- A controlled experiment isolating relationship density (the ratio of actual to possible communication edges) in an 8-agent multi-agent system found that higher connectivity does not improve performance — recovery rates stayed flat across all density levels.
- As network density increased, agents used a shrinking fraction of available communication edges, suggesting that raw pathway count is a poor proxy for effective information flow.
- The experiment used a fully deterministic agent policy (TF-IDF-based fact selection) instead of live LLM calls, enabling reproducible, zero-API-cost benchmarking in pure Python.
- Network topology was strictly generated via connected Erdős–Rényi random graphs, eliminating confounding variables like central hubs or hand-tuned structures.
- The key engineering takeaway: the critical metric is not how many connections exist, but how many actually carry useful information.
Why It Matters
This work challenges the common industry assumption that multi-agent failures stem from prompt quality or model capability, redirecting attention to the structural topology of agent communication. For practitioners designing multi-agent systems, it provides a reproducible experimental template that isolates a single architectural variable — something rarely done in practice where topology and edge count are changed simultaneously. The findings suggest that over-connecting agents may be wasteful, and that sparser, more purposeful communication graphs could be equally or more effective.
Technical Details
- Topology generation: Connected Erdős–Rényi random graphs with uniform edge sampling; disconnected samples are rejected and resampled, ensuring all five density levels (20%, 40%, 60%, 80%, 100%) are structurally valid and comparable.
- Agent policy: Fully deterministic — each of the 8 agents selects the unshared fact least similar (via TF-IDF cosine similarity) to already-stated information, eliminating LLM stochasticity and API costs entirely.
- Experimental design: 5 density levels × 10 independent trials = 50 total runs, with all random seeds locked before execution for full reproducibility; benchmarks ran locally on CPU (Python 3.12, zero external API calls).
- Graph metric: Relationship density defined as D = E / (N × (N − 1)) for a directed graph, where an 8-agent system has 56 possible directed edges.
- Code and protocol: Complete implementation and pre-specified test protocol are publicly available in the author's repository.
Industry Insight
- Multi-agent system designers should measure actual edge utilization (information-carrying pathways) rather than assuming more connections improve outcomes; sparse but well-used topologies may outperform fully connected meshes.
- The deterministic experimental framework presented here offers a low-cost template for isolating architectural variables in agent research, avoiding the expense and noise of live LLM benchmarking during iterative design.
- When troubleshooting multi-agent failures (endless loops, context drift, token burn), structural routing and communication topology should be investigated alongside prompt engineering, as the bottleneck may be network architecture rather than individual agent capability.
Disclaimer: The above content is generated by AI and is for reference only.