arXiv (All)
open access
Majority Dynamics on Resampled Sparse Erdős--Rényi Graphs: Gaussian Winner Selection in Collaborative Agent Networks
Collective decisions in agent networks emerge from repeated local interactions, as agents update their opinions (colors) based on their neighbors, potentially leading to consensus. In sparse communication graphs, repeated interactions can amplify both the initial majority preference and the random f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Randomly Initialized Networks Can Learn from Peer-to-Peer Consensus#120532
- Message Order Selects Opposite Collective Opinions on Laplacian-Cospectral Networks#659261
- Message Order Selects Opposite Collective Opinions on Laplacian-Cospectral Networks#657125
- Re-Rooting-Based Fault-Tolerant Broadcasting in Dense Gaussian Networks#280145
- Strategic Information Transmission over Gossip Networks#997582
Record · ID 1215447
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive