In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either , a -dimensional torus or an \ER graph, and then flip independent coins to delete edges, or delete vertices. Let be the threshold for percolation in the diluted graph. We will primarily be concerned with two phenomena. (i) The critical value for the contact process on the dliuted graph does not converge to as . (ii) In contrast to the contact process on a homogeneous graph, the density of 1’s starting from all sites occupied converges to 0 at a polynomial rate when (the ``Griffiths phase’') and like when .

生成讲解博客的中文版本

生成AI智能校验的中文版本