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

The loop erased exit path and the metastability of a biased vote process

Author

Listed:
  • Catoni, Olivier
  • Chen, Dayue
  • Xie, Jun

Abstract

The reduction method provides an algorithm to compute large deviation estimates of (possibly nonreversible) Markov processes with exponential transition rates. It replaces the original graph minimisation equations of Freidlin and Wentzell by more tractable path minimisation problems. When applied to study the metastability of the dynamics, it gives a large deviation principle for the loop erased exit path from the metastable state. To illustrate this, we study a biased majority vote process generalising the one introduced in Chen (1997. J. Statist. Phys. 86 (3/4), 779-802). We show that this nonreversible dynamics has a two well potential with a unique metastable state, we give an upper bound for its relaxation time, and show that for small enough values of the bias the exit path is typically different at low temperature from the typical exit paths of the Ising model.

Suggested Citation

  • Catoni, Olivier & Chen, Dayue & Xie, Jun, 2000. "The loop erased exit path and the metastability of a biased vote process," Stochastic Processes and their Applications, Elsevier, vol. 86(2), pages 231-261, April.
    • Handle: RePEc:eee:spapps:v:86:y:2000:i:2:p:231-261
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(99)00096-4
    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.

    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:86:y:2000:i:2:p:231-261. 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.