The content consists of six chapters. Following Chapter 2, which introduces readers to the Monte Carlo algorithm and highlights the advantages of MCMC, Chapter 3 presents the general aspects of MCMC. Chapter 4 illustrates the essence of MCMC through the simple example of the Metropolis algorithm. In turn, Chapter 5 explains the HMC algorithm, Gibbs sampling algorithm and Metropolis-Hastings algorithm, discussing their pros, cons and pitfalls. Lastly, Chapter 6 presents several applications of MCMC. Including a wealth of examples and exercises with solutions, as well as sample codes and further math topics in the Appendix, this book offers a valuable asset for students and beginners in various fields.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.