Showing a limited preview of this publication:
Monte Carlo (MC) method is probably the most widespread simulation technique due to its ease of use. Quasi-Monte Carlo (QMC) methods have been designed in order to speed up the convergence rate of MC but their implementation requires more stringent assumptions. For instance, the direct QMC simulation of Markov chains is inefficient due to the correlation of the points used. We propose here to survey the QMC-based methods that have been developed to tackle the QMC simulation of Markov chains. Most of those methods were hybrid MC/QMC methods. We compare them with a recently developped pure QMC method and illustrate the better convergence speed of the latter.
Published Online: 2008-05-09
Published in Print: 2004-12
© de Gruyter 2004
