Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario

Christophe Andrieu, Samuel Livingstone

Research output: Contribution to journalArticle (Academic Journal)peer-review

49 Downloads (Pure)

Abstract

Historically time-reversibility of the transitions or processes underpinning Markov chain Monte Carlo methods (MCMC) has played a key r\^ole in their development, while the self-adjointness of associated operators together with the use of classical functional analysis techniques on Hilbert spaces have led to powerful and practically successful tools to characterize and compare their performance. Similar results for algorithms relying on nonreversible Markov processes are scarce. We show that for a type of nonreversible Monte Carlo Markov chains and processes, of current or renewed interest in the Physics and Statistical literatures, it is possible to develop comparison results which closely mirror those available in the reversible scenario. We show that these results shed light on earlier literature, proving some conjectures and strengthening some earlier results.
Original languageEnglish
Pages (from-to)1958-1981
Number of pages24
JournalAnnals of Statistics
Volume49
Issue number4
DOIs
Publication statusPublished - 1 Aug 2021

Bibliographical note

Funding Information:
Funding. The authors acknowledge support from EPSRC “Intractable Likelihood: New Challenges from Modern Applications (ILike)”, (EP/K014463/1). CA acknowledges support from EPSRC “Computational Statistical Inference for Engineering and Security (CoSInES)”, (EP/R034710/1).

Publisher Copyright:
© Institute of Mathematical Statistics, 2021

Keywords

  • Markov chain Monte Carlo
  • Peskun ordering
  • piecewise deterministic Markov processes

Fingerprint

Dive into the research topics of 'Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario'. Together they form a unique fingerprint.

Cite this