cs.AIJul 13, 2026

Graph Feedback Controls Consensus and Clique Formation in Open-Weight Language-Model Populations

Authors: Samer Saab, Chaouki Abdallah

Organizations: Lebanese American University Byblos, Lebanon · Electrical and Computer Engineering Department Lebanese American University Byblos, Lebanon

Abstract

Multi-agent language-model systems increasingly route local interactions, yet the runtime interaction graph is often treated as an implementation detail. We study convention formation in open-weight LM populations spanning 1.1B-32B parameters with a naming-game protocol. Restricted first-token scores over tokenizer-safe labels let us measure prompt-conditioned score-state distributions, construct state-similarity graphs, and separate sampled-label agreement from latent state-space consensus. Across controlled interventions, in the main open-weight repair grids, retained partner-label evidence is necessary but not sufficient: homophilous threshold-similarity routing deletes cross-basin exposure and amplifies fragmentation, while bridge-seeking routing often repairs fragmentation when memory is available. In a three-seed mixed four-model grid, threshold-similarity produces no final behavioral or state consensus in 189 setting-seed runs, whereas state-component and label-disagreement bridges recover final behavioral consensus in 14/18 retained-memory runs. Across homogeneous model populations, retained history generally shifts fragmented dynamics toward consensus; the clearest case is Qwen2.5-32B, which reaches stable behavioral and final state consensus in all 18 retained-history well-mixed settings, while threshold-similarity reaches neither form of consensus in 189 settings. Robustness over state thresholds, population size, and vocabulary size preserves the qualitative ordering, and early-window graph-energy features provide useful within-grid diagnostics.

Explore similar work

CardsList
Aug 7, 2026physics.soc-ph

Same physical state, different collective dynamics: state encodings select synchronization outcomes in language-model agents

Language-model agents act on state encodings of their environment, yet these are treated as interchangeable interfaces. Using pretrained language models, we designed a circular-synchronization experiment applying a state-encoding intervention while holding the physical system fixed: each agent sees only a summary of its neighbours' relative phases and chooses to advance, stay or retard. Encoding that state as low-order circular moments rather than as a histogram selected different collective outcomes. In GPT the moment encoding synchronized the population in 6/6 seeds and the histogram encodings in 0/6; the effect replicated in Claude but reversed direction. Replaying identical fields shifted each agent's advance/stay/retard probabilities far beyond within-encoding repeat variation, in GPT, Claude and Gemini; in GPT, presentation alone shifted the operator with the moment values fixed. State encodings therefore form part of a model-dependent effective interaction law, not a neutral interface.
Takahiro Ezaki, Naoto Imura, Katsuhiro Nishinari
Collective BehaviorsEncode
AskPDF
May 12, 2026cs.MA

Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies

Practitioners deploying multi-agent large language model (LLM) systems must currently choose between communication topologies such as chain, star, mesh, and richer variants without any pre-inference diagnostic for which topology will amplify drift, converge to consensus, or remain robust under perturbation. Existing evaluation answers these questions only post hoc and only for the task measured. We introduce a structural diagnostic for multi-agent LLM communication graphs based on the successor representation M=(I−γP)−1M = (I - γP)^{-1} of the row-stochastic communication operator, and we connect three of its spectral quantities, the spectral radius ρ(M)ρ(M), the spectral gap Δ(M)Δ(M), and the condition number κ(M)κ(M), to three distinct failure modes. We derive closed-form spectra for the chain, star, and mesh under row-stochastic normalization, and validate the predictions on a 12-step structured state-tracking task with Qwen2.5-7B-Instruct over 100 independent trials. The condition number is a perfect rank-order predictor of empirical perturbation robustness (rs=1.0r_s = 1.0); the spectral gap partially predicts consensus dynamics (rs=0.5r_s = 0.5); and the spectral radius is perfectly \emph{inverted} with respect to cumulative error (rs=−1.0r_s = -1.0). We trace this inversion to a regime in which linear spectra are blind to non-contracting bias drift, and we propose an affine-noise extension of the predictive map that recovers the empirical ordering. We read this as a first step toward representational, drift-aware structural diagnostics for multi-agent LLM systems, sitting alongside classical spectral and consensus theory.
Ethan Parks, Dalal Alharthi
Multi-Agent ReasoningConsensusSuccessor Representations
AskPDF
Aug 3, 2026physics.soc-ph

Microscopic dynamics of consensus formation in multi-agent LLM Naming Games

Decentralized populations of Large Language Model (LLM) agents can spontaneously reach consensus on shared conventions, yet the microscopic mechanisms by which their internal stochasticity shapes macroscopic ordering remain unexplored. We study a minimal LLM Naming Game in which the listener's decision is a single-token LLM call at decoding temperature TT, replacing the inventory check of the deterministic Naming Game. Each interaction decomposes into an in-inventory and an out-inventory channel with conditional rates π(T) ⁣≡ ⁣P(YES∣w∈Pj)π(T)\!\equiv\!P(\text{YES}\mid w\in P_j) and φ(T) ⁣≡ ⁣P(YES∣w∉Pj)φ(T)\!\equiv\!P(\text{YES}\mid w\notin P_j), whose balance controls an ordering-disordering drift. A mean-field theory of the two-rate dynamics yields an analytical ordering condition that generalizes the consensus threshold of the stochastic Naming Game to a critical line in the (π,φ)(π,φ) plane. Across three open-weight architectures, consensus is always reached, but through three distinct listener regimes: permissive (repaint-noise dominated), near-deterministic, and conservative (missed-collapse dominated). The effective finite-size exponent β(T)β(T) in tconv ⁣∼ ⁣Nβt_{\rm conv}\!\sim\!N^β shifts with temperature, and the temperature-sensitivity αα in tc ⁣∼ ⁣eαTt_c\!\sim\!e^{αT} ranges from ≈ 0.67{\approx}\,0.67 to ≈ 0{\approx}\,0 across architectures. Decoding temperature thus emerges as an architecture-dependent control parameter for decentralized LLM populations, quantitatively characterized by the statistical-physics toolkit.
Cristiano De Nobili, Vijayasri Iyer, Alessandro Codello +1
Consensus
AskPDF