PreprintarXiv licencearXiv
The voter model on the hyperbolic graph
Abstract
We consider the voter model on the giant component of a hyperbolic random graph, which is a spatial scale-free network, in the sparse and linear-giant regime α∈(1/2,1). We find that the quenched expected consensus time has order n2−1/α, as the number of vertices n→∞, with probability arbitrarily close to one. This is generalised to the voter model where each vertex changes its opinion at rates q(v)=d(v)φ, where we also establish the consensus time orders for all φ≥ 0. These orders have 3 regimes, with a phase transition at φ=2−2α. For the upper bounds, our main proof idea is to connect the meeting set to some fixed target vertex of appropriate height in the product chain electrical network, to make rigorous an argument due to Durrett.
Related
- Hyperbolic Graph Representation Learning: Embed in One Metric, Optimize with Another
- Ageing in the exact correlations of the voter model on a fractal
- Threshold-Safe Shock Absorption in a Compartmental Voter-Flow Model:\ A Conservative Impulse-Control Benchmark
- Partisan voter model on complex networks: Dynamics of local ordering
- CLT for quadratic additive functionals of three-dimensional and four-dimensional voter models
BibTeX
@misc{fernley2026voter,
title = {{The voter model on the hyperbolic graph}},
author = {John Fernley and Christian Hirsch},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.01143},
eprint = {2609.01143},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.01143},
}
RIS
TY - UNPB
TI - The voter model on the hyperbolic graph
AU - John Fernley
AU - Christian Hirsch
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.01143
UR - https://arxiv.org/abs/2609.01143
AB - We consider the voter model on the giant component of a hyperbolic random graph, which is a spatial scale-free network, in the sparse and linear-giant regime α∈(1/2,1). We find that the quenched expected consensus time has order n^2−1/α, as the number of vertices n→∞, with probability arbitrarily close to one. This is generalised to the voter model where each vertex changes its opinion at rates q(v)=d(v)^φ, where we also establish the consensus time orders for all φ≥ 0. These orders have 3 regimes, with a phase transition at φ=2−2α. For the upper bounds, our main proof idea is to connect the meeting set to some fixed target vertex of appropriate height in the product chain electrical network, to make rigorous an argument due to Durrett.
ER -