On Metropolis-Hastings algorithms with delayed rejection

Mira Antonietta ()
Additional contact information
Mira Antonietta: Department of Economics, University of Insubria, Italy

Economics and Quantitative Methods from Department of Economics, University of Insubria

Abstract: The class of Metropolis-Hastings algorithms can be modified by delaying the rejection of proposed moves. The new samplers are proved to perform better than the original ones in terms of asymptotic variance of the estimates on a sweep by sweep basis. The delaying rejection algorithms also allow some space for local adaptation of the proposal distribution. We give an iterative formula for the acceptance probability at the i-th iteration of the delaying process. A special case is discussed in detail: the delaying rejection algorithm with symmetric proposal distribution

Keywords: Markov chain Monte Carlo Methods; Metropolis-Hastings algorithm; Asymptotic variance; Peskun ordering (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-ets
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ins:quaeco:qf0005

Access Statistics for this paper

More papers in Economics and Quantitative Methods from Department of Economics, University of Insubria Contact information at EDIRC.
Bibliographic data for series maintained by Segreteria Dipartimento ().