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

Approximations of Piecewise Deterministic Markov Processes and their convergence properties

Author

Listed:
  • Bertazzi, Andrea
  • Bierkens, Joris
  • Dobson, Paul

Abstract

Piecewise deterministic Markov processes (PDMPs) are a class of stochastic processes with applications in several fields of applied mathematics spanning from mathematical modelling of physical phenomena to computational methods. A PDMP is specified by three characteristic quantities: the deterministic motion, the law of the random event times, and the jump kernels. The applicability of PDMPs to real world scenarios is currently limited by the fact that these processes can be simulated only when these three characteristics of the process can be simulated exactly. In order to overcome this problem, we introduce discretisation schemes for PDMPs which make their approximate simulation possible. In particular, we design both first order and higher order schemes that rely on approximations of one or more of the three characteristics. For the proposed approximation schemes we study both pathwise convergence to the continuous PDMP as the step size converges to zero and convergence in law to the invariant measure of the PDMP in the long time limit. Moreover, we apply our theoretical results to several PDMPs that arise from the computational statistics and mathematical biology literature.

Suggested Citation

  • Bertazzi, Andrea & Bierkens, Joris & Dobson, Paul, 2022. "Approximations of Piecewise Deterministic Markov Processes and their convergence properties," Stochastic Processes and their Applications, Elsevier, vol. 154(C), pages 91-153.
    • Handle: RePEc:eee:spapps:v:154:y:2022:i:c:p:91-153
    DOI: 10.1016/j.spa.2022.09.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414922001958
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2022.09.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Alexandre Bouchard-Côté & Sebastian J. Vollmer & Arnaud Doucet, 2018. "The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 113(522), pages 855-867, April.
    2. Bierkens, Joris & Bouchard-Côté, Alexandre & Doucet, Arnaud & Duncan, Andrew B. & Fearnhead, Paul & Lienart, Thibaut & Roberts, Gareth & Vollmer, Sebastian J., 2018. "Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains," Statistics & Probability Letters, Elsevier, vol. 136(C), pages 148-154.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Murray Pollock & Paul Fearnhead & Adam M. Johansen & Gareth O. Roberts, 2020. "Quasi‐stationary Monte Carlo and the ScaLE algorithm," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 82(5), pages 1167-1221, December.
    2. Quan Zhou & Jun Yang & Dootika Vats & Gareth O. Roberts & Jeffrey S. Rosenthal, 2022. "Dimension‐free mixing for high‐dimensional Bayesian variable selection," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(5), pages 1751-1784, November.
    3. M Ludkin & C Sherlock, 2023. "Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithm," Biometrika, Biometrika Trust, vol. 110(2), pages 301-318.
    4. Gael M. Martin & David T. Frazier & Christian P. Robert, 2020. "Computing Bayes: Bayesian Computation from 1763 to the 21st Century," Monash Econometrics and Business Statistics Working Papers 14/20, Monash University, Department of Econometrics and Business Statistics.
    5. Saifuddin Syed & Alexandre Bouchard‐Côté & George Deligiannidis & Arnaud Doucet, 2022. "Non‐reversible parallel tempering: A scalable highly parallel MCMC scheme," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 321-350, April.
    6. Dobson, Paul & Bierkens, Joris, 2023. "Infinite dimensional Piecewise Deterministic Markov Processes," Stochastic Processes and their Applications, Elsevier, vol. 165(C), pages 337-396.
    7. Matias Quiroz & Mattias Villani & Robert Kohn & Minh-Ngoc Tran & Khue-Dung Dang, 2018. "Subsampling MCMC - an Introduction for the Survey Statistician," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 80(1), pages 33-69, December.
    8. Gael M. Martin & David T. Frazier & Christian P. Robert, 2022. "Computing Bayes: From Then `Til Now," Monash Econometrics and Business Statistics Working Papers 14/22, Monash University, Department of Econometrics and Business Statistics.

    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:154:y:2022:i:c:p:91-153. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.