Partisan voter model on complex networks: Dynamics of local ordering
Abstract
We investigate the processes of local ordering for the partisan voter model on complex networks. In this model, agents hold a binary opinion and a fixed preference that biases updates toward alignment with their preferred opinion. We first study the dynamics on uncorrelated random networks and derive a pair approximation that resolves the densities of links connecting different classes of agents. The analytical predictions are in excellent agreement with Monte Carlo simulations. In this setting, partisan bias leaves the total stationary density of links connecting nodes in different sates unchanged and at the same value as in the standard voter model, but redistributes it among different categories of links. We then consider preference-dependent networks with homophilic and heterophilic attachment to analyze the competition between the global bias mechanism and the local effect of preference-based connectivity. In this case, structural correlations qualitatively modify the stationary state. We identify different regimes of local ordering in the space of parameters measuring the strength of the preference and the strength of the homophilic attachment. Our work clarifies the distinct roles of dynamical partisan bias and structural assortativity, and provides an analytical framework to study partisan opinion dynamics beyond mean-field theory.
Versions
Related
- Temporal Conductance and Bounds on the Voter Model for Dynamic Networks
- Distance backbones optimize spreading dynamics and centrality ranks in the sparsification of complex networks
- Improved rapid phase ordering for Ising dynamics on random regular graphs
- The voter model on the hyperbolic graph
- Ageing in the exact correlations of the voter model on a fractal
BibTeX
@misc{llabres2026partisan,
title = {{Partisan voter model on complex networks: Dynamics of local ordering}},
author = {Jaume Llabrés and Maxi San Miguel and Raúl Toral},
howpublished = {arXiv},
year = {2026},
month = jul,
doi = {10.48550/arxiv.2606.05062},
eprint = {2606.05062},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.05062},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Partisan voter model on complex networks: Dynamics of local ordering
AU - Jaume Llabrés
AU - Maxi San Miguel
AU - Raúl Toral
PY - 2026
DA - 2026/07/17
PB - arXiv
DO - 10.48550/arxiv.2606.05062
UR - https://arxiv.org/abs/2606.05062
AB - We investigate the processes of local ordering for the partisan voter model on complex networks. In this model, agents hold a binary opinion and a fixed preference that biases updates toward alignment with their preferred opinion. We first study the dynamics on uncorrelated random networks and derive a pair approximation that resolves the densities of links connecting different classes of agents. The analytical predictions are in excellent agreement with Monte Carlo simulations. In this setting, partisan bias leaves the total stationary density of links connecting nodes in different sates unchanged and at the same value as in the standard voter model, but redistributes it among different categories of links. We then consider preference-dependent networks with homophilic and heterophilic attachment to analyze the competition between the global bias mechanism and the local effect of preference-based connectivity. In this case, structural correlations qualitatively modify the stationary state. We identify different regimes of local ordering in the space of parameters measuring the strength of the preference and the strength of the homophilic attachment. Our work clarifies the distinct roles of dynamical partisan bias and structural assortativity, and provides an analytical framework to study partisan opinion dynamics beyond mean-field theory.
ER -