IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v121y2011i3p609-629.html
   My bibliography  Save this article

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

Author

Listed:
  • Peterson, Jonathon

Abstract

We study the contact process on the complete graph on n vertices where the rate at which the infection travels along the edge connecting vertices i and j is equal to [lambda]wiwj/n for some [lambda]>0, where wi are i.i.d. vertex weights. We show that when there is a phase transition at [lambda]c>0 such that for [lambda] [lambda]c the contact process lives for an exponential amount of time. Moreover, we give a formula for [lambda]c and when [lambda]>[lambda]c we are able to give precise approximations for the probability that 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 [lambda]c>0 when in fact [lambda]c=0.

Suggested Citation

  • Peterson, Jonathon, 2011. "The contact process on the complete graph with random vertex-dependent infection rates," Stochastic Processes and their Applications, Elsevier, vol. 121(3), pages 609-629, March.
    • Handle: RePEc:eee:spapps:v:121:y:2011:i:3:p:609-629
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(10)00261-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xue, Xiaofeng, 2016. "Critical value for contact processes on clusters of oriented bond percolation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 205-215.
    2. Xue, Xiaofeng, 2013. "Contact processes with random connection weights on regular graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 4749-4759.
    3. Xue, Xiaofeng, 2017. "Law of large numbers for the SIR model with random vertex weights on Erdős–Rényi graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 434-445.
    4. Xue, Xiaofeng, 2016. "Critical value for the contact process with random recovery rates and edge weights on regular tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 793-806.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:121:y:2011:i:3:p:609-629. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.