Voter Models on Heterogeneous Networks
V. Sood, Tibor Antal, S. Redner

TL;DR
This paper analyzes voter and invasion models on heterogeneous networks, deriving consensus times and fixation probabilities, revealing how network degree distribution influences dynamics and outcomes.
Contribution
It provides explicit formulas for consensus time and fixation probability on heterogeneous networks, extending understanding of these models beyond regular structures.
Findings
Consensus time scales as N mu_1^2/mu_2, faster on broad degree distributions.
Fixation probability for mutants depends on node degree, proportional to k or 1/k.
Results generalize to biased dynamics favoring one state.
Abstract
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor. For the voter model, an individual "imports" its state from a randomly-chosen neighbor. Here the average time T_N to reach consensus for a network of N nodes with an uncorrelated degree distribution scales as N mu_1^2/mu_2, where mu_k is the kth moment of the degree distribution. Quick consensus thus arises on networks with broad degree distributions. We also identify the conservation law that characterizes the route by which consensus is reached. Parallel results are derived for the invasion process, in which the state of an agent is "exported" to a random neighbor. We further generalize to biased dynamics in which one state is favored. The probability…
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.
