Voter Model — Opinion Dynamics
Each node adopts a random neighbor's opinion. Consensus is guaranteed on finite graphs.
Parameters
Nodes N
60
Mean degree k
4
Speed
20 steps/frame
Voter model rule:
Pick random node i
Pick random neighbor j
Set opinion(i) ← opinion(j)
Consensus time ~ N² (complete graph)
Statistics
Step
0
Opinion A fraction
—
Opinion B fraction
—
Active interfaces
—
Consensus reached
No
Controls
⏸ Pause
New Network
Randomize Opinions
Coarsening on lattice ~ t^(1/2)
On networks: depends on topology
Scale-free: slow consensus
Complete graph: fastest