The Contact Process on Periodic Trees

From MaRDI portal



Abstract: A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values lambda1 and lambda2 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 lambda1 and lambda2 and for the corresponding critical values lambdag and lambdaell for branching random walk. Much of what we find for period two (a,b) trees was known to Pemantle. However, two significant new results give sharp asymptotics for the critical value lambda2 of (1,n) trees and generalize that result to the (a1,ldots,ak,n) tree when maxiailen1−epsilon and a1cdotsak=nb. We also give results for lambdag and lambdaell on (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+c and abc.












This page was built for publication: The Contact Process on Periodic Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6305079)