4.5 Article

Ordering and improving the performance of Monte Carlo Markov chains

Journal

STATISTICAL SCIENCE
Volume 16, Issue 4, Pages 340-350

Publisher

INST MATHEMATICAL STATISTICS
DOI: 10.1214/ss/1015346319

Keywords

asymptotic variance; convergence ordering; covariance ordering; efficiency ordering; Metropolis-Hastings algorithm; Peskun ordering; reversible jumps

Ask authors/readers for more resources

An overview of orderings defined on the space of Markov chains having a prespecified unique stationary distribution is given. The intuition gained by studying these orderings is used to improve existing Markov chain Monte Carlo algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available