Reproduce “Scaling Laws for Majority-based Opinion Dynamics in the Presence of Stubborn Agents” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Luke Meredith, Arpan Mukhopadhyay
The authors analyze opinion dynamics on a fully connected network where non-stubborn agents follow a majority rule and stubborn agents remain fixed. They show that stubborn-agent fractions shape stationary outcomes and convergence times: unequal fractions favor the larger faction in the long run. At the critical boundary, mixing time is Θ(n^{1/3}) for unequal fractions and Θ(n^{1/2}) for equal fractions, within this model.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.