Metraipolis › archive › dc_fa6fadc72256
Extinction and Survival for a Generalized Contact Process with Deterministic Cures — arXiv:2609.29425
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29425
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:07:51.609Z
- SHA-256 of the archived text
ab9d32a2ab840382ed5e374da0de64367a788803cd871301855dbe26ba1f6934- Stable URL of this page
https://metraipolis.com/documento/dc_fa6fadc72256
How to cite
Extinction and Survival for a Generalized Contact Process with Deterministic Cures — arXiv:2609.29425 — arXiv (en), https://arxiv.org/abs/2609.29425 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa6fadc72256 (Metraipolis archive dc_fa6fadc72256, sha256 ab9d32a2ab840382ed5e374da0de64367a788803cd871301855dbe26ba1f6934)
BibTeX
@misc{dcfa6fadc72256,
title = {Extinction and Survival for a Generalized Contact Process with Deterministic Cures — arXiv:2609.29425},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29425},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa6fadc72256; sha256 ab9d32a2ab840382ed5e374da0de64367a788803cd871301855dbe26ba1f6934},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29425. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study a generalized contact process on \(\mathbb{Z}^d\) parameterized by an infection rate \(\lambda\) and a resetting probability \(p \in [0,1]\), modeling deterministic cure times. Once a vertex is infected, its recovery is scheduled exactly one time unit later. Incoming attempts to an already-infected vertex successfully reset its recovery clock with probability \(p\), and are ignored otherwise. This unifies spatial versions of classical Type I (\(p=0\), non-paralyzable) and Type II (\(p=1\), paralyzable) counters. Except in the fully resetting case, deterministic recovery deadlines destroy coordinatewise attractiveness and create a causal shielding effect. Using a first-moment bound on potential causal chains, we prove that the process dies out from finite configurations whenever \(\lambda<1/(2d)\), uniformly in \(p\in[0,1]\). The same causal-chain bound yields local convergence to the empty configuration from arbitrary initial states. In dimensions \(d \ge 2\), an oriented percolation exploration based on the first infective window establishes global survival for all \(p\in[0,1]\) when \(\lambda>-\log(1-p_c^{\mathrm{or}})\). Finally, in the purely non-resetting case \(p=0\), we derive a delayed identity for the one-site density and prove that this density remains strictly between zero and one at every finite time.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.29425 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T05:35:05.141Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).