2004 | OriginalPaper | Chapter
Markov Chain Monte Carlo Methods
Authors : Wolfgang Hörmann, Josef Leydold, Gerhard Derflinger
Published in: Automatic Nonuniform Random Variate Generation
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We have seen in Chapter 11 that the generation of random vectors is often not easy. The rejection based algorithms what we presented there are from a practical point of view limited to small dimensions up to at most 10. And there are lots of distributions that are even difficult to sample from in dimension three or four. A totally different approach is based on the fact that we always can easily construct a Markov chain that has the desired fixed multivariate distribution as its unique stationary distribution. Of course there is a price we have to pay for this simplicity: the dependence of the generated vectors.