Computation of Expectations by Markov Chain Monte Carlo Methods

This publication has 17 references indexed in Scilit:

• Positivity of hit-and-run and related algorithms
  Electronic Communications in Probability, 2013
• Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
  The Annals of Statistics, 2011
• Curvature, concentration and error estimates for Markov chain Monte Carlo
  The Annals of Probability, 2010
• On the computational complexity of MCMC-based estimators in large samples
  The Annals of Statistics, 2009
• Simple Monte Carlo and the Metropolis algorithm
  Journal of Complexity, 2007
• Hit-and-Run from a Corner
  SIAM Journal on Computing, 2006
• General state space Markov chains and MCMC algorithms
  Probability Surveys, 2004
• Geometric L² and L¹ convergence are equivalent for reversible Markov chains
  Journal of Applied Probability, 2001
• Geometric Ergodicity and Hybrid Markov Chains
  Electronic Communications in Probability, 1997
• Rates of convergence of the Hastings and Metropolis algorithms
  The Annals of Statistics, 1996