2103.07319
Epidemics on Hypergraphs: Spectral Thresholds for Extinction
Desmond John Higham, Henry-Louis de Kergorlay
correcthigh confidence
- Category
- math.DS
- Journal tier
- Strong Field
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper’s Theorem 8.1 proves the non-extinction probability bound by constructing a stochastically dominating auxiliary process Y with linear rates and then solving the corresponding linear ODE for its expectations, yielding P(∑ Xi(t) > 0) ≤ n i0 exp((β f′(0) λ(W) − δ) t) and exponential die-out when β f′(0) λ(W) < δ. The candidate solution derives a differential inequality directly for p(t)=E[X(t)] using the generator and the global tangent bound f(x) ≤ f′(0) x (concavity with f(0)=0), then controls ||p(t)||2 and converts to the same probability bound. Both are logically valid; the techniques differ (stochastic domination vs. direct expectation drift inequality).
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions
\textbf{Journal Tier:} strong field
\textbf{Justification:}
The core extinction bound for concave infection functions on hypergraphs is correct and clearly presented. The approach via stochastic domination yields an interpretable spectral threshold and is well-aligned with the mean-field analysis. Numerical experiments support the theory. Minor textual corrections (e.g., a typographical error in an exponent) and a few clarifying remarks would further enhance readability.