The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Comparison Theorems for Reversible Markov Chains
Open accessAbstract
We introduce geometric comparison inequalities that give bounds on the eigenvalues of a reversible Markov chain in terms of the eigenvalues of a second chain. The bounds are applied to get sharp results for the exclusion process.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
(2016) · Foundations of Physically Based Modeling and Animation · doi:10.1201/9781315373140-16 · Cited by 3,267
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Self-citationGeometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Self-citationGenerating a random permutation with random transpositions
Diaconis, P., & Shahshahani, M. (1981) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00535487 · Cited by 575
Self-citationFill, J. A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005981 · Cited by 320
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
Self-citationComparison Techniques for Random Walk on Finite Groups
Diaconis, P., & Saloff-Coste, L. (1993) · The Annals of Probability · doi:10.1214/aop/1176989013 · Cited by 194
Self-citationTime to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
Diaconis, P., & Shahshahani, M. (1987) · SIAM Journal on Mathematical Analysis · doi:10.1137/0518016 · Cited by 160
Self-citationImproved 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
Moderate growth and random walk on finite groups
Diaconis, P. W., & Saloff‐Coste, L. (1994) · Geometric and Functional Analysis · doi:10.1007/bf01898359 · Cited by 71
Self-citation
Cited by
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Bayesian Computation and Stochastic Systems
Besag, J., Green, P., Higdon, D., & Mengersen, K. (1995) · Statistical Science · doi:10.1214/ss/1177010123 · Cited by 944
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Laplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
Training restricted Boltzmann machines: An introduction
Fischer, A., & Igel, C. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.025 · Cited by 504
Metadata
- Authors
- Diaconis, P., & Saloff-Coste, L.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 1993-08-01
- Volume
- 3
- Issue
- 3
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W1976418263
- Cited by
- 423
- References
- 13
- FWCI
- 8.42
- Type
- journal article
- Language
- en
- Open access
- bronze
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.