English

The Contact Process on Periodic Trees

Probability 2019-01-21 v3

Abstract

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values λ1\lambda_1 and λ2\lambda_2 for global and local survival were different. Here, we will consider the case of trees in which the degrees of vertices are periodic. We will compute bounds on λ1\lambda_1 and λ2\lambda_2 and for the corresponding critical values λg\lambda_g and λ\lambda_\ell for branching random walk. Much of what we find for period two (a,b)(a,b) trees was known to Pemantle. However, two significant new results give sharp asymptotics for the critical value λ2\lambda_2 of (1,n)(1,n) trees and generalize that result to the (a1,,ak,n)(a_1,\ldots, a_k, n) tree when maxiain1ϵ\max_i a_i \le n^{1-\epsilon} and a1ak=nba_1 \cdots a_k = n^b. We also give results for λg\lambda_g and λ\lambda_\ell on (a,b,c)(a,b,c) trees. Since the values come from solving cubic equations, the explicit formulas are not pretty, but it is surprising that they depend only on a+b+ca+b+c and abcabc.

Keywords

Cite

@article{arxiv.1808.01863,
  title  = {The Contact Process on Periodic Trees},
  author = {Yufeng Jiang and Remy Kassem and Grayson York and Brandon Zhao and Xiangying Huang and Matthew Junge and Rick Durrett},
  journal= {arXiv preprint arXiv:1808.01863},
  year   = {2019}
}

Comments

27 pages

R2 v1 2026-06-23T03:25:24.949Z