Unusual properties of contact processes on percolated graphs

Abstract

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 Zd, a d-dimensional torus or an graph, and then flip independent (1-p) coins to delete edges, or delete vertices. Let p* 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 λc(p) does not converge to ∞ as p p*. (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 p<p* (the ``Griffiths phase'') and like c/( t)a when p=p*.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…