Contact Processes with Random Recovery Rates and Edge Weights on Complete Graphs

Abstract

In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with n vertices. We show that the model has a critical value which is inversely proportional to the product of the mean of the edge weight and the mean of the inverse of the recovery rate. In the subcritical case, the process dies out before a moment with order O(log n) with high probability as n → +∞. In the supercritical case, the process survives at a moment with order exp{O(n)} with high probability as n → +∞. Our proof for the subcritical case is inspired by the graphical method introduce in [6]. Our proof for the supercritical case is inspired by approach introduced in [10], which deal with the case where the contact process is with random vertex weights.