Two convergence properties of hybrid samplers

@inproceedings{Roberts1997TwoCP,
  title={Two convergence properties of hybrid samplers},
  author={Gareth O. Roberts and Jeffrey S. Rosenthal},
  year={1997}
}
Theoretical work on Markov chain Monte Carlo (MCMC) algorithms has so far mainly concentrated on the properties of simple algorithms such as the Gibbs sampler, or the full-dimensional Hastings-Metropolis algorithm. In practice, these simple algorithms are used as building blocks for more sophisticated methods, which we shall refer to as hybrid samplers. It is often hoped that good convergence properties (geometric ergodicity, etc.) of the building blocks will imply similar properties of the… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
14 Extracted Citations
8 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-8 of 8 references

Bayesian computation via the Gibbs sampler

  • Monte Carlo
  • J. Amer. Stat. Assoc
  • 1993
Highly Influential
6 Excerpts

Discussion of Tierney ( 1994 )

  • A. F. M. Smith
  • Ann . Stat .
  • 1994

Sampling based approaches to calculating

  • A. E. Gelfand, A.F.M. Smith
  • 1990
1 Excerpt

Strong stopping times and finite random walks

  • D. Aldous, P. Diaconis
  • 1987
1 Excerpt

Equa - tions of state calculations by fast computing machines

  • R. L. Tweedie
  • J . Chem . Phys .
  • 1953

Similar Papers

Loading similar papers…