The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process
Open accessAbstract
We extend recently developed eigenvalue bounds on mixing rates for reversible Markov chains to nonreversible chains. We then apply our results to show that the $d$-particle simple exclusion process corresponding to clockwise walk on the discrete circle $\mathbf{Z}_p$ is rapidly mixing when $d$ grows with $p$. The dense case $d = p/2$ arises in a Poisson blockers problem in statistical mechanics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
(2016) · Foundations of Physically Based Modeling and Animation · doi:10.1201/9781315373140-16 · Cited by 3,267
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
A Lower Bound for the Smallest Eigenvalue of the Laplacian
Cheeger, J. (2015) · Problems in Analysis: A Symposium in Honor of Salomon Bochner (PMS-31) · doi:10.1515/9781400869312-013 · Cited by 961
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Interaction of Markov Processes
Spitzer, F. (1991) · Random Walks, Brownian Motion, and Interacting Particle Systems · doi:10.1007/978-1-4612-0459-6_5 · Cited by 527
Shuffling Cards and Stopping Times
Aldous, D., & Diaconis, P. (1986) · The American Mathematical Monthly · doi:10.1080/00029890.1986.11971821 · Cited by 475
Lawler, G. F., & Sokal, A. D. (1988) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1988-0930082-9 · Cited by 265
Strong Stationary Times Via a New Form of Duality
Diaconis, P., & Fill, J. A. (1990) · The Annals of Probability · doi:10.1214/aop/1176990628 · Cited by 253
Self-citation
Cited by
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Laplacians and the Cheeger Inequality for Directed Graphs
Chung, F. (2005) · Annals of Combinatorics · doi:10.1007/s00026-005-0237-z · Cited by 535
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 447
Lectures on finite Markov chains
Saloff-Coste, L. (1997) · Lecture Notes in Mathematics · doi:10.1007/bfb0092621 · Cited by 382
Push-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304
Metadata
- Authors
- Fill, J. A.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 1991-02-01
- Volume
- 1
- Issue
- 1
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W2069092471
- Cited by
- 320
- References
- 13
- FWCI
- 11.15
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process. https://app.cochat.ai/papers/10.1214/aoap/1177005981
- The paper
- Fill, J. A. (1991). Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process. The Annals of Applied Probability. https://doi.org/10.1214/aoap/1177005981
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.
