Back to results

University of British Columbia

Markov chain Monte Carlo algorithm comparisons

Abstract

dc:description

Various Markov chain Monte Carlo algorithms are available for sampling from a posterior distribution. The random walk Metropolis algorithm is a simple scheme which is frequently used in Bayesian statistical problem. The guided walk algorithm attempts to suppress the random walk behavior in the random walk Metropolis algorithm. Other algorithms, such as the Langevin algorithm and the hybrid algorithm use more information about the posterior distribution than the random walk Metropolis algorithm and the guided walk algorithm. In this thesis, The performance of each of those four algorithms has been examined, based on simulation studies using multivariate normal target distributions. Then we compare the algorithms in terms of efficiency and convergence time. Moreover, these four algorithms are compared using a posterior distribution for parameters given observed data in an application.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Statistics
Grantor dc:publisher
University of British Columbia
Year dc:date
2001

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wen, Sijin

Rights

dc:rights
Statement dc:rights
  • For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/11604

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Wen, Sijin. Markov chain Monte Carlo algorithm comparisons. master's thesis, University of British Columbia, 2001. http://hdl.handle.net/2429/11604