pith. sign in

arxiv: 2404.04128 · v2 · submitted 2024-04-05 · 🧮 math.PR · math-ph· math.CO· math.MP

Balanced two-type annihilation: mean-field asymptotics

John Haslegrave , Peter Keevash This is my paper

Pith reviewed 2026-05-24 02:34 UTC · model grok-4.3

classification 🧮 math.PR math-phmath.COmath.MP
keywords two-type annihilationinteracting particle systemsextinction timecomplete graphmean-field asymptoticsrandom walksannihilation processbalanced populations
0
0 comments X

The pith

Expected extinction time for two-type annihilation on K_{2n} is (2+o(1))n log n independent of relative speeds.

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

The paper examines an interacting particle system on the complete graph where two equal-sized populations of particles perform random walks, possibly at different speeds, and annihilate when opposite types meet. It focuses on the expected time until no particles remain. Under suitable initial conditions the authors establish that this time is asymptotically 2n log n on K_{2n}. The leading term and order of magnitude hold regardless of the speed ratio between the two types. A reader would care because the result settles the magnitude of extinction time in the basic mean-field case that had remained open.

Core claim

Under essentially optimal assumptions on the starting configuration, the expected extinction time on K_{2n} is (2+o(1))n log n, independently of the relative speeds of the two types.

What carries the argument

Balanced two-type annihilation process on the complete graph K_{2n}, where particles of opposite types annihilate upon meeting via random-walk steps.

If this is right

  • The leading asymptotic term remains 2n log n even when one type moves arbitrarily faster than the other.
  • Both the order of magnitude and the precise leading coefficient are determined for the mean-field setting.
  • The result applies whenever the initial configuration meets the stated balance and spread conditions.
  • Extinction occurs after Θ(n log n) steps with high probability under those conditions.

Where Pith is reading between the lines

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

  • The speed-independence may extend to other dense or expander graphs where mixing is rapid.
  • The same leading term could appear in related models of chemical kinetics or competing populations on dense networks.
  • Unbalanced initial populations would likely require a different scaling analysis to determine the extinction time.
  • The proof technique may adapt to show concentration of the extinction time around its expectation.

Load-bearing premise

The initial placement of the two particle populations must satisfy essentially optimal assumptions on the complete graph.

What would settle it

An exact or numerical computation of expected extinction time for a sequence of starting configurations satisfying the paper's assumptions where the time falls outside the interval [(2-ε)n log n, (2+ε)n log n] for some fixed ε>0 and all large n.

read the original abstract

We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in annihilation. The key quantity of interest is the expected extinction time. Even for the mean-field setting of complete graphs, the correct order of magnitude was not previously known. Under essentially optimal assumptions on the starting configuration, we determine not only the order of magnitude but also the asymptotics: the expected extinction time on $K_{2n}$ is $(2+o(1))n\log n$, independently of the relative speeds of the two types.

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 / 1 minor

Summary. The paper analyzes a two-type annihilation process on the complete graph K_{2n} in which equal-sized populations of particles perform independent random walks (possibly at different speeds) and annihilate upon meeting an opposite-type particle. Under essentially optimal assumptions on the initial configuration, it derives the sharp asymptotic for the expected extinction time: (2+o(1))n log n, independent of the speed ratio between the two types.

Significance. If the derivation holds, the result supplies the first precise leading-term asymptotic for extinction time in the mean-field balanced annihilation model, resolving both the order of magnitude and the counter-intuitive speed independence. The parameter-free character of the leading coefficient and the clean mean-field analysis constitute a useful benchmark for the field.

minor comments (1)
  1. The phrase 'essentially optimal assumptions' is used in the abstract and introduction; a single displayed statement of the precise initial-condition hypotheses (e.g., as Assumption 1.1) would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation to accept the manuscript. We are pleased that the work is viewed as supplying a useful benchmark for the mean-field balanced annihilation model.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives the (2+o(1))n log n asymptotic for expected extinction time on K_{2n} via direct probabilistic analysis of the two-type annihilation dynamics under the stated initial-configuration assumptions. No step reduces by construction to a fitted parameter, self-definition, or load-bearing self-citation; the independence from relative speeds follows from explicit meeting-rate bounds that are external to the target quantity. The derivation is self-contained against standard coupon-collector and coupling techniques.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests on standard axioms of probability and random-walk theory on graphs together with the stated assumptions on initial configuration; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • standard math Standard axioms of probability theory and the theory of random walks on graphs
    The model is defined via random walks and annihilation events whose analysis requires these background results.

pith-pipeline@v0.9.0 · 5632 in / 1191 out tokens · 25722 ms · 2026-05-24T02:34:55.812509+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Arratia, Limiting point processes for rescalings of c oalescing and annihilating random walks on Z d

    R. Arratia, Limiting point processes for rescalings of c oalescing and annihilating random walks on Z d. Ann. Probab. 9:6 (1981), 909–936

    work page 1981

  2. [2]

    Arratia, Site recurrence for annihilating random wal ks on Z d

    R. Arratia, Site recurrence for annihilating random wal ks on Z d. Ann. Probab. 11:3 (1983), 706–713

    work page 1983

  3. [3]

    Bramson and J

    M. Bramson and J. L. Lebowitz, Asymptotic behavior of den sities in diffusion dominated two-particle reactions. Phys. A 168:1 (1990), 88–94

    work page 1990

  4. [4]

    Bramson and J

    M. Bramson and J. L. Lebowitz, Spatial structure in diffusi on-limited two-particle reac- tions. J. Statist. Phys. 65:5–6 (1991), 941–951

    work page 1991

  5. [5]

    Bramson and J

    M. Bramson and J. L. Lebowitz, Spatial structure in low di mensions for diffusion limited two-particle reactions. Ann. Appl. Probab. 11:1 (2001), 121–181

    work page 2001

  6. [6]

    Cristali, Y

    I. Cristali, Y. Jiang, M. Junge, R. Kassem, D. Sivakoff, and G. York, Two-type annihilating systems on the complete and star graph. Stochastic Process. Appl. 139 (2021), 321–342

    work page 2021

  7. [7]

    Elskens and H

    Y. Elskens and H. L. Frisch, Annihilation kinetics in the one-dimensional ideal gas. Phys. Rev. A , 31 (1985), 3812–3816

    work page 1985

  8. [8]

    Erd˝ os and P

    P. Erd˝ os and P. Ney, Some problems on random intervals an d annihilating particles, Ann. Probab. 2:5 (1974), 828–839

    work page 1974

  9. [9]

    Cooper, R

    C. Cooper, R. Els¨ asser, H. Ono, and T. Radzik, Coalescin g random walks and voting on connected graphs. SIAM J. Discrete Math. 27:4 (2013), 1748–1758

    work page 2013

  10. [10]

    Cooper, A

    C. Cooper, A. Frieze and T. Radzik, Multiple random walk s in random regular graphs. SIAM J. Discrete Math. 23 (2009), 1738–1761

    work page 2009

  11. [11]

    Donnelly and D

    P. Donnelly and D. Welsh, (1983). Finite particle syste ms and infection models. Math. Proc. Camb. Phil. Soc. 94 (1983), 167–182. 8

    work page 1983

  12. [12]

    Haslegrave and P

    J. Haslegrave and P. Keevash, Dissipative particle sys tems on expanders. Manuscript, 2024

    work page 2024

  13. [13]

    Haslegrave, V

    J. Haslegrave, V. Sidoravicius and L. Tournier, Three- speed ballistic annihilation: phase transition and universality. Selecta Math. (N.S.) 27:5 (2021), paper 84, 38pp

    work page 2021

  14. [14]

    P. L. Krapivsky, S. Redner and F. Leyvraz, Ballistic ann ihilation kinetics: The case of discrete velocity distributions. Phys. Rev. E , 51 (1995), 3977–3987

    work page 1995

  15. [15]

    Lootgieter, Probl` emes de r´ ecurrence concernant des mouvements al´ eatoires de partic- ules sur Z avec destruction

    J.-C. Lootgieter, Probl` emes de r´ ecurrence concernant des mouvements al´ eatoires de partic- ules sur Z avec destruction. Ann. Inst. H. Poincar´ e Sect. B (N.S.) 13:2 (1977), 127–139. 9

    work page 1977