The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Convergence Rates for Markov Chains
Abstract
This is an expository paper that presents various ideas related to nonasymptotic rates of convergence for Markov chains. Such rates are of great importance for stochastic algorithms that are widely used in statistics and in computer science. They also have applications to analysis of card shuffling and other areas. In this paper, we attempt to describe various mathematical techniques that have been used to bound such rates of convergence. In particular, we describe eigenvalue analysis, random walks on groups, coupling, and minorization conditions. Connections are made to modern areas of research wherever possible. Elements of linear algebra, probability theory, group theory, and measure theory are used, but efforts are made to keep the presentation elementary and accessible.
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
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
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
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Cited by
On Choosing and Bounding Probability Metrics
Gibbs, A. L., & Su, F. E. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00178.x · Cited by 1,163
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Self-citationThe Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
Some applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Language Evolution by Iterated Learning With Bayesian Agents
Griffiths, T. L., & Kalish, M. L. (2007) · Cognitive Science · doi:10.1080/15326900701326576 · Cited by 392
Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks
Scholtes, I., Wider, N., Pfitzner, R., Garas, A., Tessone, C. J., & Schweitzer, F. (2014) · Nature Communications · doi:10.1038/ncomms6024 · Cited by 304
Metadata
- Authors
- Rosenthal, J. S.
- Venue
- SIAM Review
- Published
- 1995-09
- Volume
- 37
- Issue
- 3
- Pages
- 387-405
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2018807138
- Cited by
- 187
- References
- 3
- FWCI
- 3.90
- Type
- journal article
- Language
- en
- Open access
- closed
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.