Metraipolis › archive › dc_b3b367ba0847

Percolation of the contact process on the regular tree — arXiv:2609.09972

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09972
License (as archived)
CC0-1.0
Archived
2026-10-16T09:51:20.579Z
SHA-256 of the archived text
e910bb791f5481c504256e6a5cc87bfda10992f526c4f8aca05eabea88afd193
Stable URL of this page
https://metraipolis.com/documento/dc_b3b367ba0847

How to cite

Percolation of the contact process on the regular tree — arXiv:2609.09972 — arXiv (en), https://arxiv.org/abs/2609.09972 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3b367ba0847 (Metraipolis archive dc_b3b367ba0847, sha256 e910bb791f5481c504256e6a5cc87bfda10992f526c4f8aca05eabea88afd193)
BibTeX
@misc{dcb3b367ba0847,
  title = {Percolation of the contact process on the regular tree — arXiv:2609.09972},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09972},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3b367ba0847; sha256 e910bb791f5481c504256e6a5cc87bfda10992f526c4f8aca05eabea88afd193},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09972. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The contact process on the regular tree $\mathbb{T}_d$ when $d\geq 3$ has the two phase transitions of global and of local survival, found by Pemantle and Liggett at values $\lambda_1$ and $\lambda_2$. We start the system with every vertex infected and let it relax to what is known as the upper invariant infection. In this stationary state, $\lambda_p$ is the critical value beyond which the infected vertices can percolate through $\mathbb{T}_d$, and $\lambda_{p^\complement}$ is the parameter before which the healthy vertices can percolate. We find these are both distinct phase transitions \[0<\lambda_1<\lambda_p<\lambda_2<\lambda_{p^\complement}<+\infty\] on $\mathbb{T}_d$ when $d\geq 7$. The most interesting of these comparisons is $\lambda_1<\lambda_p$, which we find for all $d\geq 3$. This comparison $\lambda_1<\lambda_p$ is a long-standing open question on $\mathbb{Z}^d$ with $d\geq 2$ and was not yet found on any other graphs except where $\lambda_p$ is infinite.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.09972 — 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-16T08:44:35.284Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).