The threshold-two contact process on a random r-regular graph has a first order phase transition

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages

Scientific paper

We consider the discrete time threshold-two contact process on a random r-regular graph on n vertices. In this process, a vertex with at least two occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We use a suitable isoperimetric inequality to show that if r is larger than 3 and p is close enough to 1, then starting from all vertices occupied, there is a positive density of occupied vertices up to time exp(c(p) n) for some positive constant c(p). In the other direction, another appropriate isoperimetric inequality allows us to show that there is a decreasing function epsilon(p) and a constant C_0(p) := 2/log(2/(1+p)) so that if the number of occupied vertices in the initial configuration is at most epsilon(p)n, then with high probability all vertexs are vacant at time C_0(p) log n. These two conclusions imply that the density of occupied vertexs in the quasi-stationary distribution (defined in the paper) is discontinuous at the critical probability p_c, which is in the interval (0,1).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The threshold-two contact process on a random r-regular graph has a first order phase transition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The threshold-two contact process on a random r-regular graph has a first order phase transition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The threshold-two contact process on a random r-regular graph has a first order phase transition will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-699792

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.