arXiv (OAI Expanded)
open access
Majority dynamics on sparse random graphs
Consider a simple undirected graph $G$ on $N$ vertices, with each vertex holding an opinion from one of two options. Starting from the initial opinions on day 1, we run majority dynamics: on each subsequent day, all vertices simultaneously adopt the majority opinion among their neighbors, retaining
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
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
- Randomly Initialized Networks Can Learn from Peer-to-Peer Consensus#120532
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Consensus time for asynchronous $\ell^p$ relaxation: graph dependence#926733
- Competing bootstrap processes on the random graph $G(n,p)$#984796
Record · ID 1084861
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