Stationarity and Convergence of the Metropolis-Hastings Algorithm: Insights into Theoretical Aspects

@article{Hill2019StationarityAC,
  title={Stationarity and Convergence of the Metropolis-Hastings Algorithm: Insights into Theoretical Aspects},
  author={S. Hill and J. Spall},
  journal={IEEE Control Systems},
  year={2019},
  volume={39},
  pages={56-67}
}
  • S. Hill, J. Spall
  • Published 2019
  • Computer Science
  • IEEE Control Systems
  • Markov chain Monte Carlo (MCMC) is a versatile sampling approach that is useful in a wide range of estimation and simulation applications. Fundamentally, MCMC is a powerful general means of generating random samples from probability distributions from which it is otherwise difficult to draw samples. The MCMC method is named for its reliance on the construction of a Markovian (dependent) sequence of random variables. Under modest conditions, the sequence has a limiting probability distribution… CONTINUE READING
    3 Citations

    Topics from this paper.

    References

    SHOWING 1-10 OF 17 REFERENCES
    Estimation via Markov Chain Monte Carlo
    • 43
    • Highly Influential
    Markov Chains for Exploring Posterior Distributions
    • 3,359
    • PDF
    Markov Chains and Stochastic Stability
    • 5,004
    Bayesian system identification via Markov chain Monte Carlo techniques
    • 83
    • PDF
    A Monte Carlo Approach to Nonnormal and Nonlinear State-Space Modeling
    • 592
    • PDF
    Modes of convergence of Markov chain transition probabilities
    • 7
    Explaining the Gibbs Sampler
    • 2,511
    • PDF