2006Illinois Journal of MathematicsOpen access

Examples comparing importance sampling and the Metropolis algorithm

Federico Bassetti, Persi Diaconis

Open full text 24 citations

Abstract

Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov-chain Monte-Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.

Open-access reader

About this research paper

What this paper is about

Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov-chain Monte-Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov-chain Monte-Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.

Key concepts: Metropolis–Hastings algorithm, Markov chain Monte Carlo, Rejection sampling, Markov chain, Sampling (signal processing), Slice sampling, Mathematics, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Examples comparing importance sampling and the Metropolis algorithm — Research Paper | ScholarLens