The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
General state space Markov chains and MCMC algorithms
Open accessAbstract
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity are presented, along with quantitative bounds on the rate of convergence to stationarity. Many of these results are proved using direct coupling constructions based on minorisation and drift conditions. Necessary and sufficient conditions for Central Limit Theorems (CLTs) are also presented, in some cases proved via the Poisson Equation or direct regeneration constructions. Finally, optimal scaling and weak convergence results for Metropolis-Hastings algorithms are discussed. None of the results presented is new, though many of the proofs are. We also describe some Open Problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Inference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“Introduction Markov chain Monte Carlo (MCMC) algorithms – such as the MetropolisHastings algorithm ([53], [37]) and the Gibbs sampler (e.”
MethodDoob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Markov Processes: Characterization and Convergence.
Abakuks, A., Ethier, S. N., & Kurtz, T. G. (1987) · Biometrics · doi:10.2307/2531839 · Cited by 4,233
Markov Processes: Characterization and Convergence
Ethier, S. N., & Kurtz, T. G. (1986) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316658 · Cited by 3,634
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Applied Probability and Queues
Dave, U. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.184 · Cited by 2,704
Independent and stationary sequences of random variables
Ibragimov, I. A., Ліннік, Ю. В., & Kingmán, J. F. C. (1971) · Cited by 2,448
Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
Cowles, M. K., & Carlin, B. P. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476956 · Cited by 2,056
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods
Smith, A. F. M., & Roberts, G. O. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01466.x · Cited by 1,713
Self-citationWeak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693 · cited 2×
“Then it is proved in [67] (see also [74]), using the theory from Ethier and Kurtz [26], that as d → ∞, the process {Zd t }t≥0 converges weakly to a diffusion process {Zt}t≥0 which satisfies the following stochastic differential equation: dZt = h(l) 1/2 dBt + 1 2 h(l)∇ log πu(Zt) dt.”
BackgroundMethodSelf-citationHuber, P. J. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4612-0667-5_6 · Cited by 1,551
Sampling-Based Approaches to Calculating Marginal Densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.2307/2289776 · Cited by 1,504
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Exact sampling with coupled Markov chains and applications to statistical mechanics
Propp, J. G., & Wilson, D. B. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-o · Cited by 1,159
Optimal scaling for various Metropolis-Hastings algorithms
Roberts, G. O., & Rosenthal, J. S. (2001) · Statistical Science · doi:10.1214/ss/1015346320 · Cited by 1,103
Self-citationLectures on the Coupling Method
Lindvall, T. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,096
Stein, C. (1972) · Probability Theory · doi:10.1525/9780520423671-036 · Cited by 1,029
Kipnis, C., & Varadhan, S. R. S. (1986) · Communications in Mathematical Physics · doi:10.1007/bf01210789 · Cited by 802
Møller, J., Syversveen, A. R., & Waagepetersen, R. P. (1998) · Scandinavian Journal of Statistics · doi:10.1111/1467-9469.00115 · Cited by 751
General Irreducible Markov Chains and Non-Negative Operators
Nummelin, E. (1984) · Cambridge University Press eBooks · doi:10.1017/cbo9780511526237 · Cited by 639
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Self-citationGeneral Irreducible Markov Chains and Non-Negative Operators.
Rao, M. B., & Nummelin, E. (1985) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981963 · Cited by 599
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Rosenthal, J. S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476548 · Cited by 487
Self-citationRandom walks on finite groups and rapidly mixing markov chains
Aldous, D. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0068322 · Cited by 450
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
Self-citationA new approach to the limit theory of recurrent Markov chains
Athreya, K. B., & Ney, P. (1978) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1978-0511425-0 · Cited by 412
On adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Self-citationGeometric Ergodicity and Hybrid Markov Chains
Roberts, G., & Rosenthal, J. (1997) · Electronic Communications in Probability · doi:10.1214/ecp.v2-981 · Cited by 317
Self-citationOn the Asymptotics of Constrained $M$-Estimation
Geyer, C. J. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325768 · Cited by 301
Adaptive Markov Chain Monte Carlo through Regeneration
Gilks, W. R., Roberts, G. O., & Sahu, S. K. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473766 · Cited by 297
Self-citationThe Lindeberg-Lévy theorem for martingales
Billingsley, P. (1961) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1961-0126871-x · Cited by 276
Honest Exploration of Intractable Probability Distributions via Markov Chain Monte Carlo
Hobert, J. P., & Jones, G. L. (2001) · Statistical Science · doi:10.1214/ss/1015346317 · Cited by 258
Strong uniform times and finite random walks
Aldous, D., & Diaconis, P. (1987) · Advances in Applied Mathematics · doi:10.1016/0196-8858(87)90006-6 · Cited by 233
Regeneration in Markov Chain Samplers
Mykland, P., Tierney, L., & Yu, B. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476507 · Cited by 224
Kendall, W. S., & Møller, J. (2000) · Advances in Applied Probability · doi:10.1017/s0001867800010284 · Cited by 190
Convergence Rates for Markov Chains
Rosenthal, J. S. (1995) · SIAM Review · doi:10.1137/1037083 · Cited by 187
Self-citationRenewal theory and computable convergence rates for geometrically ergodic Markov chains
Baxendale, P. H. (2005) · The Annals of Applied Probability · doi:10.1214/105051604000000710 · Cited by 181
Markov‐chain monte carlo: Some practical implications of theoretical results
Roberts, G. O., & Rosenthal, J. S. (1998) · Canadian Journal of Statistics · doi:10.2307/3315667 · Cited by 151
Self-citationA Central Limit Theorem for a Class of Dependent Random Variables
Ibragimov, I. A. (1963) · Theory of Probability and Its Applications · doi:10.1137/1108007 · Cited by 120
Quantitative bounds on convergence of time-inhomogeneous Markov chains
Douc, R., Moulines, É., & Rosenthal, J. S. (2004) · The Annals of Applied Probability · doi:10.1214/105051604000000620 · Cited by 116
Self-citationSufficient burn-in for Gibbs samplers for a hierarchical random effects model
Jones, G. L., & Hobert, J. P. (2004) · The Annals of Statistics · doi:10.1214/009053604000000184 · Cited by 101
Improved bounds for mixing rates of Markov chains and multicommodity flow
Sinclair, A. (1992) · Lecture notes in computer science · doi:10.1007/bfb0023849 · Cited by 94
Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
Christensen, O. F., Roberts, G. O., & Rosenthal, J. S. (2005) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.1467-9868.2005.00500.x · Cited by 86
Self-citationOn the convergence of the Markov chain simulation method
Athreya, K. B., Doss, H., & Sethuraman, J. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066200 · Cited by 85
Extension of Fill's perfect rejection sampling algorithm to general chains
Fill, J. A., Machida, M., Murdoch, D. J., & Rosenthal, J. S. (2000) · Random Structures and Algorithms · doi:10.1002/1098-2418(200010/12)17:3/4<290::aid-rsa6>3.0.co;2-q · Cited by 75
Self-citationRates of Convergence for Gibbs Sampling for Variance Component Models
Rosenthal, J. S. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324619 · Cited by 68
Self-citationAnalysis of the Gibbs sampler for a model related to James-Stein estimators
Rosenthal, J. S. (1996) · Statistics and Computing · doi:10.1007/bf00140871 · Cited by 66
Self-citationImproving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are BetterPreprint
Neal, R. M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0407281 · Cited by 48
From metropolis to diffusions: Gibbs states and optimal scaling
Breyer, L. A., & Roberts, G. O. (2000) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(00)00041-7 · Cited by 47
Self-citationPossible biases induced by mcmc convergence diagnostics
Cowles, M. K., Roberts, G. O., & Rosenthal, J. S. (1999) · Journal of Statistical Computation and Simulation · doi:10.1080/00949659908811968 · Cited by 47
Self-citationA simulation approach to convergence rates for Markov chain Monte Carlo algorithms
Cowles, M. K., & Rosenthal, J. S. (1998) · Statistics and Computing · doi:10.1023/a:1008982016666 · Cited by 46
Self-citationAsymptotic Variance and Convergence Rates of Nearly-Periodic Markov Chain Monte Carlo Algorithms
Rosenthal, J. S. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503388619193 · Cited by 46
Self-citation[Practical Markov Chain Monte Carlo]: Rejoinder
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011147 · Cited by 44
Rates of Convergence for Data Augmentation on Finite Sample Spaces
Rosenthal, J. S. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005366 · Cited by 37
Self-citationShift-coupling and convergence rates of ergodic averages
Roberts, G. O., & Rosenthal, J. S. (1997) · Stochastic Models · doi:10.1080/15326349708807418 · Cited by 31
Self-citationA note on acceptance rate criteria for CLTS for Metropolis–Hastings algorithms
Roberts, G. O. (1999) · Journal of Applied Probability · doi:10.1239/jap/1032374766 · Cited by 23
Self-citationSMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS
Roberts, G. O., & Rosenthal, J. S. (2001) · Stochastic Models · doi:10.1081/stm-100002060 · Cited by 22
Self-citationA review of asymptotic convergence for general state space Markov chains
Rosenthal, S. (2002) · Cited by 21
Optimal metropolis algorithms for product measures on the vertices of a hypercube
Roberts, G. O. (1998) · Stochastics and stochastics reports · doi:10.1080/17442509808834136 · Cited by 19
Self-citationAsymptotic Variance and Convergence Rates of Nearly-Periodic MCMC Algorithms
Rosenthal, S. (2002) · Cited by 17
Cited by
A Conceptual Introduction to Hamiltonian Monte Carlo
Betancourt, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.02434 · Cited by 509
The geometric foundations of Hamiltonian Monte Carlo
Betancourt, M., Byrne, S., Livingstone, S., & Girolami, M. (2017) · Bernoulli · doi:10.3150/16-bej810 · Cited by 452
Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
Roberts, G. O., & Rosenthal, J. S. (2007) · Journal of Applied Probability · doi:10.1239/jap/1183667414 · Cited by 362
Self-citationTheoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Dalalyan, A. S. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12183 · Cited by 315
Fixed-Width Output Analysis for Markov Chain Monte Carlo
Jones, G. L., Haran, M., Caffo, B. S., & Neath, R. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000492 · Cited by 301
Metadata
- Authors
- Roberts, G. O., & Rosenthal, J. S.
- Venue
- Probability Surveys
- Publisher
- Institute of Mathematical Statistics
- Published
- 2004-01-01
- Volume
- 1
- Issue
- none
- Pages
- 20-71
- ISSN
- 1549-5787 (ISSN-L)
- OpenAlex
- W2142623799
- Cited by
- 734
- References
- 70
- FWCI
- 10.83
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.