Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 37 min ago
PreprintCC BY 4.0arXiv

On Completion Times under Memoryless Catastrophe

Abstract

We study the completion time of a task subject to independent reset (catastrophe) at each step. The completion-time PGF depends on the base-process PGF through an affine relation, and we exploit this structure systematically. Our main result shows that, among age-based catastrophe mechanisms, geometric-tail catastrophe is exactly the class that yields uniform affine PGF structure; in continuous time, the characterization sharpens to Poisson resetting. We establish a sharp two-sided Kolmogorov bound of order p+|α| for the exponential approximation dK(T/E[T], Exp(1)), thereby closing a logarithmic gap. Applications to the coupon collector with reset coupons reveal a discontinuous Gumbel-to-Exponential transition under resetting, while a multi-phase model exhibits a Gaussian-to-exponential transition with exponential convergence rate.

Related

  1. Information, Estimation, and Prediction for Discrete Memoryless Channels via Poissonization
    Abhiram Gorle, Tsachy Weissman
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Umbral Hermite representations of canonical catastrophe integrals
    Giuseppe Dattoli, Roberto Ricci
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Optimal Catastrophe Bond Design and its Applications to Climate Change Risk
    Andres Medina, Wei Wei
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Density Collapse and Gradient Catastrophe in a One-Dimensional Euler--Poisson--Cattaneo System
    Qingsong Zhao
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Universality in the Transition from Inspiral to Plunge for Extreme-Mass-Ratio-Inspirals: High-Accuracy Analytic Solutions and Catastrophe Theory
    Ariadna Ribes Metidieri, Béatrice Bonga, Badri Krishnan +1
    arXivPreprintCC BY 4.0Full textHigh-energy astrophysicsMathematical physicsarXiv
BibTeX
@misc{wang2026completion,
  title = {{On Completion Times under Memoryless Catastrophe}},
  author = {Sichen Wang and Zhipeng Lu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16566},
  eprint = {2609.16566},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16566},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - On Completion Times under Memoryless Catastrophe
AU  - Sichen Wang
AU  - Zhipeng Lu
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.16566
UR  - https://arxiv.org/abs/2609.16566
AB  - We study the completion time of a task subject to independent reset (catastrophe) at each step. The completion-time PGF depends on the base-process PGF through an affine relation, and we exploit this structure systematically. Our main result shows that, among age-based catastrophe mechanisms, geometric-tail catastrophe is exactly the class that yields uniform affine PGF structure; in continuous time, the characterization sharpens to Poisson resetting. We establish a sharp two-sided Kolmogorov bound of order p+|α| for the exponential approximation d_K(T/E[T], Exp(1)), thereby closing a logarithmic gap. Applications to the coupon collector with reset coupons reveal a discontinuous Gumbel-to-Exponential transition under resetting, while a multi-phase model exhibits a Gaussian-to-exponential transition with exponential convergence rate.
ER  -