Metraipolis › archive › dc_391ae867b217
The voter model on the hyperbolic graph — arXiv:2609.01143
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01143
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:05:57.858Z
- SHA-256 of the archived text
ee00097a04579a5396665ab38cab0921f027dc404ce9965c082a6fe0ade69ea0- Stable URL of this page
https://metraipolis.com/documento/dc_391ae867b217
How to cite
The voter model on the hyperbolic graph — arXiv:2609.01143 — arXiv (en), https://arxiv.org/abs/2609.01143 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_391ae867b217 (Metraipolis archive dc_391ae867b217, sha256 ee00097a04579a5396665ab38cab0921f027dc404ce9965c082a6fe0ade69ea0)
BibTeX
@misc{dc391ae867b217,
title = {The voter model on the hyperbolic graph — arXiv:2609.01143},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01143},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_391ae867b217; sha256 ee00097a04579a5396665ab38cab0921f027dc404ce9965c082a6fe0ade69ea0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01143. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $\alpha\in(1/2,1)$. We find that the quenched expected consensus time has order $n^{2-1/\alpha}$, as the number of vertices $n\to\infty$, with probability arbitrarily close to one. This is generalised to the voter model where each vertex changes its opinion at rates $q(v)={\rm d}(v)^\varphi$, where we also establish the consensus time orders for all $\varphi\geq 0$. These orders have 3 regimes, with a phase transition at $\varphi=2-2\alpha$. 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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.01143 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:52:29.070Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).