pith. sign in

arxiv: 2405.08202 · v2 · submitted 2024-05-13 · 🧮 math.PR

The mean field stubborn voter model

Lisa Hartung , Christian M\"onch This is my paper

Pith reviewed 2026-05-24 00:50 UTC · model grok-4.3

classification 🧮 math.PR
keywords voter modelheavy-tailed waiting timesmean-field limitscaling limitcoalescing random walksconsensus probabilityextreme value theory
0
0 comments X

The pith

Heavy-tailed waiting times restrict the mean-field voter model to a limiting process on the slowest agents whose consensus probabilities depend only on the tail index.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies the voter model on the complete graph where each agent has its own i.i.d. heavy-tailed waiting time between updates. It establishes a scaling limit as the number of agents grows, in which the dynamics reduce to an infinite voter model acting only on the sites with the slowest updates. Consensus probabilities in this limit are derived in closed form and turn out to be functions solely of the tail index of the waiting-time distribution, via the extreme-value properties of those times. The proof proceeds by analyzing the dual system of coalescing random walks and showing that this system comes down from infinity.

Core claim

The authors derive a novel scaling limit for the mean-field voter model with agent-dependent regularly varying waiting times. They prove existence of a limiting infinite voter model supported on the slowest-updating sites and obtain explicit formulas for the consensus probabilities in that limit. These probabilities are completely determined by the extreme-value landscape of the waiting times and therefore depend on the distribution only through its tail index.

What carries the argument

The dual coalescing system of random walks on the slowest sites, shown to come down from infinity, which encodes the genealogy of opinions in the limiting voter model.

If this is right

  • Consensus in the limit is decided entirely by the ordering and relative sizes of the smallest waiting times rather than by the bulk of the distribution.
  • The limiting process is the same for every regularly varying tail with a fixed index, giving a universal description across that class.
  • The dual coalescing walks coming down from infinity supplies a concrete mechanism for computing absorption probabilities without reference to the original finite graph.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The result indicates that heterogeneous update rates can be replaced by a deterministic ordering of stubbornness levels when predicting long-run outcomes.
  • Similar reductions may apply to other mean-field interacting particle systems whose clocks have heavy tails.
  • The explicit dependence on the tail index offers a direct way to test the model against empirical distributions of update intervals.

Load-bearing premise

Waiting times are i.i.d. with regularly varying heavy tails and the interaction structure is the complete graph.

What would settle it

A direct computation or large-scale simulation of the finite-N model whose consensus probability fails to converge to the explicit tail-index formula as N tends to infinity.

read the original abstract

We analyse the effect of agent-dependent heavy-tailed waiting times in the voter model on the complete graph with $N$ vertices. We derive a novel scaling limit and show the existence of a limiting infinite voter model on the slowest updating sites. We further derive the consensus probabilities in the limit model explicitly. In the mean-field setting, the limit is determined by the extreme-value landscape of the waiting times and depends only on the tail index. To obtain these results, we study the coalescing system of random walks that is dual to the limit voter model and prove, among other auxiliary results, that it comes down from infinity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper analyzes the voter model on the complete graph with N vertices, where each vertex has an i.i.d. waiting time with regularly varying heavy tail. It derives a scaling limit to an infinite voter model supported on the slowest-updating sites, proves that the dual system of coalescing random walks comes down from infinity, and obtains explicit consensus probabilities in the limit model; these probabilities are determined by the extreme-value ordering of the waiting times and depend only on the tail index.

Significance. If the derivations hold, the work supplies a new scaling limit for mean-field interacting particle systems with heterogeneous heavy-tailed clocks, connecting voter-model consensus to extreme-value theory in a parameter-free way once the tail index is fixed. The explicit consensus formulas and the proof that the dual coalescent comes down from infinity are technically substantive contributions that could serve as a template for other mean-field models with power-law waiting times.

minor comments (2)
  1. §2.2: the definition of the rescaled process X^N_t should explicitly state the time scaling factor in terms of the tail index α before the limit statement in Theorem 3.1.
  2. Figure 1: the caption does not indicate whether the plotted trajectories are single realizations or averages; adding this would improve readability of the simulation results.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment and recommendation of minor revision. The referee's summary accurately reflects the paper's contributions on the scaling limit of the mean-field voter model with regularly varying waiting times, the dual coalescent coming down from infinity, and the explicit consensus probabilities governed by the tail index via extreme-value ordering.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained via duality and auxiliary proofs

full rationale

The paper derives a scaling limit for the mean-field voter model with i.i.d. regularly varying waiting times by establishing duality to a coalescing random walk system on the complete graph, then proving that this dual process comes down from infinity and extracting explicit consensus probabilities from the extreme-value ordering of the waiting times. All steps are direct mathematical arguments from the stated assumptions (regular variation of tails, complete-graph interaction) with no parameter fitting, no renaming of known empirical patterns as novel results, and no load-bearing self-citations that reduce the central claims to prior unverified assertions by the same authors. The auxiliary results are proved within the paper rather than imported circularly. This matches the expected non-circular outcome for a pure existence-and-explicit-formula derivation in probability theory.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard assumptions about i.i.d. heavy-tailed waiting times and the complete-graph mean-field geometry; no free parameters or invented entities are introduced.

axioms (2)
  • domain assumption Waiting times are i.i.d. with regularly varying heavy tail
    Invoked to obtain the extreme-value landscape that determines the limit.
  • domain assumption Interaction occurs on the complete graph (mean-field)
    Enables the scaling limit and duality analysis.

pith-pipeline@v0.9.0 · 5617 in / 1220 out tokens · 42753 ms · 2026-05-24T00:50:23.598027+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    A model for spatial conflict.Biometrika, 60:581– 588, 1973

    Peter Clifford and Aidan Sudbury. A model for spatial conflict.Biometrika, 60:581– 588, 1973. ISSN 0006-3444,1464-3510. doi: 10.1093/biomet/60.3.581. URL https: //doi.org/10.1093/biomet/60.3.581

    work page doi:10.1093/biomet/60.3.581 1973

  2. [2]

    Theodore Cox and David Griffeath

    J. Theodore Cox and David Griffeath. Occupation time limit theorems for the voter model.Ann. Probab., 11(4):876–893, 1983. ISSN 0091-1798,2168- 894X. URL http://links.jstor.org/sici?sici=0091-1798(198311)11:4<876: OTLTFT>2.0.CO;2-3&origin=MSN

    work page 1983

  3. [3]

    D. J. Daley. Another upper bound for the renewal function.Ann. Probability, 4 (1):109–114, 1976. ISSN 0091-1798. doi: 10.1214/aop/1176996188. URL https: //doi.org/10.1214/aop/1176996188

    work page doi:10.1214/aop/1176996188 1976

  4. [4]

    D. J. Daley and D. Vere-Jones.An introduction to the theory of point processes. Vol. II. Probability and its Applications (New York). Springer, New York, second edition, 2008. ISBN 978-0-387-21337-8. doi: 10.1007/978-0-387-49835-5. URLhttps: //doi.org/10.1007/978-0-387-49835-5. General theory and structure

    work page doi:10.1007/978-0-387-49835-5 2008

  5. [5]

    Ethier and Thomas G

    Stewart N. Ethier and Thomas G. Kurtz.Markov processes. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. John Wiley & Sons, Inc., New York, 1986. ISBN 0-471-08186-8. doi: 10.1002/9780470316658. URL https://doi.org/10.1002/9780470316658. Characterization and convergence

    work page doi:10.1002/9780470316658 1986

  6. [6]

    On the entrance at infinity of Feller processes with no negative jumps.Statist

    Clément Foucart, Pei-Sen Li, and Xiaowen Zhou. On the entrance at infinity of Feller processes with no negative jumps.Statist. Probab. Lett., 165:108859, 9, 2020. ISSN 0167- 7152,1879-2103. doi: 10.1016/j.spl.2020.108859. URL https://doi.org/10.1016/j. spl.2020.108859

    work page doi:10.1016/j.spl.2020.108859 2020

  7. [7]

    Freedman, Another note on the borel-cantelli lemma and the strong law, with the poisson approxi- mation as a by-product, Annals of Probability 1 (6) (1973) 910–925

    Richard A. Holley and Thomas M. Liggett. Ergodic theorems for weakly interacting infi- nite systems and the voter model.Ann. Probability, 3(4):643–663, 1975. ISSN 0091-1798. doi: 10.1214/aop/1176996306. URLhttps://doi.org/10.1214/aop/1176996306. 29

    work page doi:10.1214/aop/1176996306 1975

  8. [8]

    The zealot voter model.Ann

    Ran Huo and Rick Durrett. The zealot voter model.Ann. Appl. Probab., 29(5): 3128–3154, 2019. ISSN 1050-5164,2168-8737. doi: 10.1214/19-AAP1476. URLhttps: //doi.org/10.1214/19-AAP1476

    work page doi:10.1214/19-aap1476 2019

  9. [9]

    Probability and its Applications (New York)

    Olav Kallenberg.Foundations of modern probability. Probability and its Applications (New York). Springer-Verlag, New York, 1997. ISBN 0-387-94957-7

    work page 1997

  10. [10]

    M. R. Leadbetter, Georg Lindgren, and Holger Rootzén.Extremes and related properties of random sequences and processes. Springer Series in Statistics. Springer-Verlag, New York-Berlin, 1983. ISBN 0-387-90731-9

    work page 1983

  11. [11]

    Liggett.Interacting particle systems, volume 276 ofGrundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]

    Thomas M. Liggett.Interacting particle systems, volume 276 ofGrundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, New York, 1985. ISBN 0-387-96069-4. doi: 10.1007/978-1-4613-8542-4. URLhttps://doi.org/10.1007/978-1-4613-8542-4

    work page doi:10.1007/978-1-4613-8542-4 1985

  12. [12]

    Gibert, and S

    Naoki Masuda, N. Gibert, and S. Redner. Heterogeneous voter models.Phys. Rev. E, 82(1):010103(R), 4, 2010. doi: 10.1103/PhysRevE.82.010103. URLhttps://doi.org/ 10.1103/PhysRevE.82.010103

    work page doi:10.1103/physreve.82.010103 2010

  13. [13]

    D6 : (color online) Landscape of energy, Seven typical examples are chosen to demon- strate the frequency landscape as varying θ and φ

    M. Mobilia, A. Petersen, and S. Redner. On the role of zealotry in the voter model.J. Stat. Mech. Theory Exp., (8):P08029, 17, 2007. ISSN 1742-5468. doi: 10.1088/1742-5468/ 2007/08/p08029. URLhttps://doi.org/10.1088/1742-5468/2007/08/p08029

    work page doi:10.1088/1742-5468/ 2007

  14. [14]

    Mazumdar, and Rahul Roy

    Arpan Mukhopadhyay, Ravi R. Mazumdar, and Rahul Roy. Voter and majority dynamics with biased and stubborn agents.J. Stat. Phys., 181(4):1239–1265, 2020. ISSN 0022- 4715,1572-9613. doi: 10.1007/s10955-020-02625-w. URL https://doi.org/10.1007/ s10955-020-02625-w

    work page doi:10.1007/s10955-020-02625-w 2020

  15. [15]

    Hydrodynamics of the voter model.Ann

    Errico Presutti and Herbert Spohn. Hydrodynamics of the voter model.Ann. Probab., 11 (4):867–875, 1983. ISSN 0091-1798,2168-894X. URLhttp://links.jstor.org/sici? sici=0091-1798(198311)11:4<867:HOTVM>2.0.CO;2-H&origin=MSN

    work page 1983

  16. [16]

    Resnick.Extreme values, regular variation and point processes

    Sidney I. Resnick.Extreme values, regular variation and point processes. Springer Series in Operations Research and Financial Engineering. Springer, New York, 2008. ISBN 978-0-387-75952-4. Reprint of the 1987 original

    work page 2008

  17. [17]

    Remco van der Hofstad.Random graphs and complex networks. Vol. 1. Cambridge Series in Statistical and Probabilistic Mathematics, [43]. Cambridge University Press, Cambridge, 2017. ISBN 978-1-107-17287-6. doi: 10.1017/9781316779422. URLhttps: //doi.org/10.1017/9781316779422

    work page doi:10.1017/9781316779422 2017

  18. [18]

    The impact of competing zealots on opinion dynamics.Phys

    Gunjan Verma, Ananthram Swami, and Kevin Chan. The impact of competing zealots on opinion dynamics.Phys. A, 395:310–331, 2014. ISSN 0378-4371,1873-2119. doi: 10.1016/j.physa.2013.09.045. URL https://doi.org/10.1016/j.physa.2013.09.045

    work page doi:10.1016/j.physa.2013.09.045 2014

  19. [19]

    ProQuest LLC, Ann Arbor, MI, 2014

    Alex Waagen.Phase Transitions on Static and Evolving Networks: Effects of Competition, Zealotry, and Growth. ProQuest LLC, Ann Arbor, MI, 2014. ISBN 978-1321-61018-5. URL http://gateway.proquest.com/openurl?url_ver= Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri: pqm&rft_dat=xri:pqdiss:3685308. Thesis (Ph.D.)–University of Californi...

    work page 2014

  20. [20]

    Binary opinion dynamics with stubborn agents.ACM Transactions on Economics and Computation (TEAC), 1(4):1–30, 2013

    Ercan Yildiz, Asuman Ozdaglar, Daron Acemoglu, Amin Saberi, and Anna Scaglione. Binary opinion dynamics with stubborn agents.ACM Transactions on Economics and Computation (TEAC), 1(4):1–30, 2013. 31

    work page 2013