English

The contact process on the complete graph with random vertex-dependent infection rates

Probability 2016-06-14 v2

Abstract

We study the contact process on the complete graph on nn vertices where the rate at which the infection travels along the edge connecting vertices ii and jj is equal to λwiwj/n \lambda w_i w_j / n for some λ>0\lambda >0, where wiw_i are i.i.d. vertex weights. We show that when E[w12]<E[w_1^2] < \infty there is a phase transition at λc>0\lambda_c > 0 so that for λ<λc\lambda<\lambda_c the contact process dies out in logarithmic time, and for λ>λc\lambda>\lambda_c the contact process lives for an exponential amount of time. Moreover, we give a formula for λc\lambda_c and when λ>λc\lambda>\lambda_c we are able to give precise approximations for the probability a given vertex is infected in the quasi-stationary distribution. Our results are consistent with a non-rigorous mean-field analysis of the model. This is in contrast to some recent results for the contact process on power law random graphs where the mean-field calculations suggested that λc>0\lambda_c>0 when in fact λc=0\lambda_c = 0.

Keywords

Cite

@article{arxiv.1005.0810,
  title  = {The contact process on the complete graph with random vertex-dependent infection rates},
  author = {Jonathon Peterson},
  journal= {arXiv preprint arXiv:1005.0810},
  year   = {2016}
}

Comments

19 pages, 1 figure

R2 v1 2026-06-21T15:18:58.219Z