Voter and majority dynamics with biased and stubborn agents

A Mukhopadhyay, RR Mazumdar, R Roy - Journal of Statistical Physics, 2020 - Springer
We study binary opinion dynamics in a fully connected network of interacting agents. The
agents are assumed to interact according to one of the following rules:(1) Voter rule: An …

Multi-colour competition with reinforcement

D Ahlberg, C Fransson - Annales de l'Institut Henri Poincare (B) …, 2024 - projecteuclid.org
We study a system of interacting urns where balls of different colour/type compete for their
survival, and annihilate upon contact. For competition between two types, the underlying …

Learning models on rooted regular trees with majority update policy: convergence and phase transition

M Podder, A Sarkar - arXiv preprint arXiv:2405.12418, 2024 - arxiv.org
We study a learning model in which an agent is stationed at each vertex of $\mathbb {T} _
{m} $, the rooted tree in which each vertex has $ m $ children. At any time-step $ t\in\mathbb …

[PDF][PDF] Technology Diffusion on Undirected Graphs with Memoryless Agents

Y Miao, Y Zhang - 2023 - researchgate.net
In this paper, we consider a model of social learning among memoryless agents, each
placed on the vertex of an undirected graph. There are two technologies, each represented …

Two models of social learning in networks, with concepts drawn from economics and physics

K Chatterjee, S Roy - The European Physical Journal Special Topics, 2016 - Springer
In this paper, we consider the status of economics as a science, especially as compared to
the most successful of sciences, physics, and formulate this in terms of the Popperian notion …