pith. sign in

arxiv: 2606.10257 · v1 · pith:VD4MOPPHnew · submitted 2026-06-08 · 🧮 math.PR

Downward conditional monotonicity gives survival and extinction for contact processes in random environments

Joseph P. Stover This is my paper

Pith reviewed 2026-06-27 14:48 UTC · model grok-4.3

classification 🧮 math.PR
keywords contact processrandom environmentMarkov-modulated Poisson processstochastic dominationquasi-birth-death processsurvival probabilityextinction criteriaconditional monotonicity
0
0 comments X

The pith

Downward conditional monotonicity of the MMPP determines survival and extinction for contact processes modulated by finite-state random environments via an eigenvalue bound on the dominating Poisson rate.

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

The paper introduces downward conditional monotonicity for Markov-modulated Poisson processes and shows that it produces the optimal stochastic domination of a homogeneous Poisson point process. The largest arrival rate permitting this domination equals a specific eigenvalue extracted from the generator matrix of the quasi-birth-death formulation of the MMPP. This domination bound is then applied to contact processes whose infection and recovery rates are driven by an underlying continuous-time Markov chain with finitely many states, yielding explicit survival and extinction regimes by sandwiching the modulated process between two standard contact processes.

Core claim

Downward conditional monotonicity for the MMPP allows the derivation of the maximal rate of a dominating Poisson process, given by an eigenvalue of the QBD generator matrix, which in turn produces survival and extinction criteria for contact processes in random environments by direct comparison with dominating and dominated standard contact processes.

What carries the argument

Downward conditional monotonicity of the MMPP, which produces stochastic domination by a Poisson process whose rate is the relevant eigenvalue of the QBD generator matrix.

If this is right

  • Contact processes survive when the infection rate exceeds the eigenvalue threshold extracted from the environment generator.
  • Contact processes become extinct when the infection rate falls below the same threshold.
  • The same eigenvalue supplies explicit bounds for any finite-state modulation of infection or recovery rates.
  • Standard contact-process comparison arguments extend directly once the dominating Poisson rate is fixed by the eigenvalue.

Where Pith is reading between the lines

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

  • The eigenvalue may admit a probabilistic interpretation as a long-run effective rate under the stationary distribution of the environment.
  • The method could be tested on small finite-state examples by solving the QBD matrix explicitly and comparing to Monte Carlo realizations of the modulated process.
  • Extensions to countably infinite environments would require showing that the monotonicity property survives suitable limits or approximations of the state space.

Load-bearing premise

The modulating random environment is a continuous-time Markov chain with a finite number of states.

What would settle it

Numerical simulation of a two-state environment contact process that survives when the infection parameter lies below the predicted eigenvalue threshold, or goes extinct above it.

read the original abstract

The concept of downward conditional monotonicity for the Markov-modulated Poisson process (MMPP) is introduced and used to derive the optimal stochastic domination of a standard Poisson point process. The maximum arrival rate for the Poisson process which allows this domination to exist is shown to be related to an eigenvalue extracted from the generator matrix of the quasi-birth--death (QBD) formulation of the MMPP. This allows derivation of survival and extinction regimes for a large family of contact processes whose infection and recovery rates vary over time according to an underlying random environment with a finite number of states. Direct comparison with standard contact processes which dominate from above and below accomplishes this.

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

Summary. The manuscript introduces the concept of downward conditional monotonicity for Markov-modulated Poisson processes (MMPPs) and shows that this property yields the optimal stochastic domination of the MMPP by a homogeneous Poisson point process. The critical (maximum) arrival rate permitting such domination is identified with an eigenvalue extracted from the generator matrix of the quasi-birth-death (QBD) formulation of the MMPP. The resulting domination bounds are then applied, via direct comparison, to establish survival and extinction regimes for a family of contact processes whose infection and recovery rates are modulated by an underlying finite-state continuous-time Markov chain.

Significance. If the central derivations hold, the work supplies a new monotonicity criterion that converts spectral information from the modulating chain into explicit domination thresholds for contact processes in random environments. This is a constructive contribution: the eigenvalue link furnishes a computable test for the critical rate, and the finite-state assumption enables the QBD representation. The approach strengthens comparison methods for interacting particle systems whose parameters vary according to an external Markov process.

minor comments (3)
  1. [Abstract] Abstract: the phrase 'related to an eigenvalue' is imprecise; the precise functional relationship (e.g., whether the rate equals the eigenvalue, a simple function of it, or the spectral radius) should be stated explicitly.
  2. [§2] §2 (definition of downward conditional monotonicity): the definition is given in terms of conditional expectations; a short illustrative example with a two-state MMPP would improve readability without lengthening the section.
  3. [§3] Notation: the generator matrix of the QBD process is denoted G in some places and Q in others; a single consistent symbol and a displayed equation for its block structure would remove ambiguity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the supportive summary, significance assessment, and recommendation of minor revision. The report lists no major comments, so we have no points requiring response or manuscript changes.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper introduces downward conditional monotonicity for the MMPP and derives the domination threshold as a function of an eigenvalue extracted from the QBD generator matrix of the modulating chain. This eigenvalue is a direct algebraic quantity computed from the given finite-state rate matrix and is not fitted to or defined in terms of the contact-process survival/extinction outcomes. The subsequent comparison arguments for upper and lower bounds are standard stochastic ordering steps that do not reduce to self-definition, self-citation, or renaming of known results. The finite-state restriction is an explicit modeling assumption that enables the QBD formulation but does not create a circular dependency within the claimed derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard construction of MMPP and QBD processes together with the finite-state assumption for the environment; no free parameters or invented entities are visible in the abstract.

axioms (1)
  • domain assumption The modulating random environment is a continuous-time Markov chain with finite state space.
    Explicitly stated in the abstract as the setting that permits the QBD formulation.

pith-pipeline@v0.9.1-grok · 5629 in / 1239 out tokens · 23505 ms · 2026-06-27T14:48:10.050520+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

22 extracted references · 18 canonical work pages

  1. [1]

    and Plemmons, R

    Berman, A. and Plemmons, R. (1994).Nonnegative Matrices in the Mathematical Sciences. Classics in Applied Mathematics9. SIAM, Philadelphia. MR1298430 https://doi.org/10.1137/1.9781611971262

    work page doi:10.1137/1.9781611971262 1994

  2. [2]

    and Grimmett, G

    Bezuidenhout, C. and Grimmett, G. (1990). The critical contact process dies out.Ann. Probab.18(4):1462–

    1990

  3. [3]

    MR1071804 https://doi.org/10.1214/aop/1176990627

    work page doi:10.1214/aop/1176990627

  4. [4]

    Convergence of

    Billingsley, P. (1999).Convergence of Probability Measures, 2nd ed. Wiley Series in Probability and Statis- tics: Probability and Statistics. Wiley, New York. MR1700749 https://doi.org/10.1002/9780470316962

    work page doi:10.1002/9780470316962 1999

  5. [5]

    Bramson, M., Durrett, R., and Schonmann, R. H. (1991). The contact process in a random environment. Ann. Probab.19(3):960–983. MR1112403 https://doi.org/10.1214/aop/1176990331

    work page doi:10.1214/aop/1176990331 1991

  6. [6]

    Broman, E. I. (2007). Stochastic domination for a hidden Markov chain with applications to the contact process in a randomly evolving environment.Ann. Probab.35(6):2263–2293. MR2353388 https://doi. org/10.1214/0091179606000001187

    work page doi:10.1214/0091179606000001187 2007

  7. [7]

    Daley, D. J. and Vere-Jones, D. (2003).An Introduction to the Theory of Point Processes. Vol. I. Elemen- tary Theory and Methods, 2nd ed. Probability and Its Applications (New York). Springer, New York. MR1950431 https://doi.org/10.1007/b97277

    work page doi:10.1007/b97277 2003

  8. [8]

    Daley, D. J. and Vere-Jones, D. (2008).An Introduction to the Theory of Point Processes. Vol. II. Gen- eral Theory and Structure, 2nd ed. Probability and Its Applications (New York). Springer, New York. MR2371524 https://doi.org/10.1007/978-0-387-49835-5

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

  9. [9]

    Harris, T. E. (1974). Contact Interactions on a Lattice.Ann. Probab., 2(6):969–988. MR0356292 https://doi.org/10.1214/aop/1176996493

    work page doi:10.1214/aop/1176996493 1974

  10. [10]

    Horn, R. A. and Johnson, C. R. (1994).Topics in Matrix Analysis. Cambridge Univ. Press, Cambridge. MR1288752 https://doi.org/10.1017/CBO9780511840371

    work page doi:10.1017/cbo9780511840371 1994

  11. [11]

    Horn, R. A. and Johnson, C. R. (2012).Matrix Analysis, 2nd ed. Cambridge Univ. Press, Cambridge. MR2978290 https://doi.org/10.1017/CBO9781139020411

    work page doi:10.1017/cbo9781139020411 2012

  12. [12]

    and Kester, A

    Keilson, J. and Kester, A. (1977) Monotone matrices and monotone Markov processes.Stochastic Process. Appl.5(3):231–241. MR0458596 https://doi.org/10.1016/0304-4149(77)90033-3

    work page doi:10.1016/0304-4149(77)90033-3 1977

  13. [13]

    Probability

    Klenke, A. (2014).Probability Theory—a Comprehensive Course, 2nd ed.Universitext.Springer, London. MR3112259 https://doi.org/10.1007/978-1-4471-5361-0

    work page doi:10.1007/978-1-4471-5361-0 2014

  14. [14]

    Liggett, T. M. (1985).Interacting Particle Systems. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]276. Springer-Verlag, New York. MR0776231 https://doi.org/10.1007/978-1-4613-8542-4

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

  15. [15]

    Liggett, T. M. (2010).Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]324. Springer-Verlag, Berlin. MR1717346 https://doi.org/10.1007/978-3-662-03990-8

    work page doi:10.1007/978-3-662-03990-8 2010

  16. [16]

    Neuts, M. (1979). A versatile Markovian point process.J. Appl. Probab.16:764–779. MR0549556 https://doi.org/10.2307/3213143

    work page doi:10.2307/3213143 1979

  17. [17]

    (1981).Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach

    Neuts, M. (1981).Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. Johns Hop- kins University Press. MR0618123

    1981

  18. [18]

    (2001).Differential Equations and Dynamical Systems, 3rd ed

    Perko, L. (2001).Differential Equations and Dynamical Systems, 3rd ed. Texts in Applied Mathematics7. Springer-Verlag, New York. MR1801796 https://doi.org/10.1007/978-1-4613-0003-8

    work page doi:10.1007/978-1-4613-0003-8 2001

  19. [19]

    Remenik, D. (2008). The contact process in a dynamic random environment.Ann. Appl. Probab. 18(6):2392–2420. MR2474541

    2008

  20. [20]

    and Szekli, R

    Rolski, T. and Szekli, R. (1991). Stochastic ordering and thinning of point processes.Stoch. Proc. Appl. 37(2):299–312. MR1102876 https://doi.org/10.1016/0304-4149(91)90049-I

    work page doi:10.1016/0304-4149(91)90049-i 1991

  21. [21]

    Steif, J. E. and Warfheimer, M. (2008). The critical contact process in a randomly evolving environment dies out.ALEA Lat. Am. J. Probab. Math. Stat.4:337–357. MR2461788

    2008

  22. [22]

    Stover, J. P. (2022). Bounds via spectral radius-preserving row sum expansions.Electron. J. Linear Algebra, 38:367–376. MR4494136 https://doi.org/10.13001/ela.2022.6981

    work page doi:10.13001/ela.2022.6981 2022