Valid Discretization via Renewal Theory

  • Chantal Guihenneuc-Jouyaux
  • Christian P. Robert
Part of the Lecture Notes in Statistics book series (LNS, volume 135)


As discussed in Chapter 2, an important drawback of Raftery and Lewis’ (1992a, 1996) convergence control method is that the discretized version of the Markov chain is not a Markov chain itself, unless a stringent lumpability condition holds (see Kemeny and Snell, 1960). This somehow invalidates the binary control method, although it provides useful preliminary information on the required number of iterations. However, the discrete aspect of the criterion remains attractive for its intuitive flavour and, while the Duality Principle of Chapter 1 cannot be invoked in every setting, this chapter shows how renewal theory can be used to construct a theoretically valid discretization method for general Markov chains. We then consider some convergence control methods based on these discretized chains, even though the chains can be used in many alternative ways (see also Chapter 5).


Markov Chain Gibbs Sampler Transition Kernel Parallel Chain Renewal Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Chantal Guihenneuc-Jouyaux
  • Christian P. Robert

There are no affiliations available

Personalised recommendations