The R Companion to MCSM (7)

After a bit of an extra delay due to our various travels to Spain and England respectively, we are now finished with writing the first draft, having completed the chapter on Gibbs samplers (which does not contain major surprises)! The sequence of chapters is thus

  1. Introduction to R programming
  2. Random variable generation
  3. Monte Carlo methods
  4. Controlling and accelerating convergence
  5. Monte Carlo optimization
  6. Metropolis-Hastings algorithms
  7. Gibbs samplers
  8. Convergence monitoring for MCMC algorithms
  9. Solutions to selected exercises

It is quite pleasant to be done with the major part, even though we could have finished a bit earlier. Besides editing and correcting for inaccuracies and incoherencies, there still remains some solutions to include in Chapter 9 and the creation of the associated R package. This part that I dread because I do not know how long it will take and how much rewriting it involves… As I posted yesterday, I also want to include some convergence assessments derived from Galin Jones’ talk, and I need to update the part on acmc since Jeff Rosenthal improves his package recently. In sheer numbers, the book is currently 277 pages long, with 88K words, 156 exercises and 83 figures. It would be nice if we could send the final version to Springer before Easter…

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

Join 336 other followers