An urn model for opinion propagation on networks
Andrew Melchionna

TL;DR
This paper models opinion dynamics on networks using a coupled Polya's urn scheme, showing that opinions evolve according to a stochastic heat equation and ultimately reach consensus.
Contribution
It introduces a novel urn-based model for opinion propagation on networks and establishes its connection to a stochastic heat equation, demonstrating consensus formation.
Findings
System governed by a discrete stochastic heat equation
Opinions converge to consensus over time
Model captures influence of conversation frequency on opinions
Abstract
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability of agreeing on a given state is a simple function of both of agents' opinions, with higher importance given to agents who have participated in more conversations. Opinions are then updated based on the results of the conversation. We show that this system is governed by a discrete version of the stochastic heat equation, and prove that the system reaches a consensus of opinion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Cellular Automata and Applications
