A Comparison of Algorithms for Sampling from a Distribution
Na (Linda) Lei successfully defended her M.Sc. project entitled "A Comparison of Algorithms for Sampling from a Distribution" on 20 August 2007.
Sampling from a distribution is an active problem in statistics. When the distribution is easy to sample from, methods like Monte Carlo are applicable. But when the distribution is complex, of non-standard form or multivariate, more complicated algorithms are required. The well-known Markov Chain Monte Carlo method using the Metropolis-Hastings (MH) algorithm can perform very well to sample the complicated distributions in many situations. But it has the drawback of being sensitive to the scale of the proposal distribution used. Recently, some algorithms have been introduced in the literature to avoid some of the problems of the MH algorithm. These include Graves method, Sliced sampling, and Equi-energy sampling. In this project, a simulation study is done to compare the performance of these algorithms under various settings of their tuning parameters when applied to various types of distributions.
This type of interdisciplinary work is a hallmark of our program in Applied Statistics at Simon Fraser University. For more information, please contact Na (Linda) Lei (email@example.com) or her supervisor Randy Sitter (firstname.lastname@example.org), Department of Statistics and Actuarial Science.