Degree-penalized contact processes

Abstract

In this paper we study degree-penalized contact processes on Galton-Watson (GW) trees and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or healthy. When infected, each vertex heals at rate one. Also, when infected, a vertex u with degree du infects its neighboring vertex v with degree d
_v with rate λ/ f (d
_u, d
_v ) for some positive function f. In the case F (d
_u, d
_v = max(d
_u, d
_v )
^u for some u ≥ 0, the infection is slowed down to and from high-degree vertices. This is in line with arguments used in social network science: people with many contacts do not have the time to infect their neighbors at the same rate as people with fewer contacts. We show that new phase transitions occur in terms of the parameter u (at 1/2) and the degree distribution D of the GW tree. ◦ When u ≥ 1, the process goes extinct for all distributions D for all sufficiently small λ > 0; ◦ When u E [1/2, 1), and the tail of D weakly follows a power law with tail-exponent less than 1 − u, the process survives globally but not locally for all λ small enough; ◦ When u E [1/2, 1), and E[D
^1−u] < ∞, the process goes extinct almost surely, for all λ small enough; ◦ When u < 1/2, and D is heavier than stretched exponential with stretch-exponent 1 − 2u, the process survives (locally) with positive probability for all λ > 0. We also study the product case, where f (d
_u, d
_v ) = (d
_ud
_v )
^u. In that case, the situation for u < 1/2 is the same as the one described above, but u ≥ 1/2 always leads to a subcritical contact process for small enough λ > 0 on all graphs. Furthermore, for finite random graphs with prescribed degree sequences, we establish the corresponding phase transitions in terms of the length of survival.