Graph Feedback Controls Consensus and Clique Formation in Open-Weight Language-Model Populations
3.80T1 sourcearXiv cs.MA
Source record
Published by arXiv cs.MA (T1 source). The original is at https://arxiv.org/abs/2607.12077.
Pipeline notes
The summary and note below are generated by the signal pipeline — they are Beyond Desk’s reading, not quotations from the source.
SummaryStudies how interaction graph topology affects consensus in populations of open-weight language models (1.1B–32B) using a naming-game protocol. Finds homophilous threshold-similarity routing amplifies fragmentation, while bridge-seeking routing with retained memory recovers behavioral consensus.
Why it mattersEmpirical evidence on which multi-agent routing topologies produce consensus versus fragmentation, with specific failure rates and success conditions across model sizes.
Cited by
No citations on record.
