The DOI matches its Crossref record.
A new approach to the limit theory of recurrent Markov chains
Open accessAbstract
Let { X n ; n ⩾ 0 } be a Harris-recurrent Markov chain on a general state space. It is shown that there is a sequence of random times { N i ; i ⩾ 1 } such that { X N i ; i ⩾ 1 } are independent and identically distributed. This idea is used to show that { X n } is equivalent to a process having a recurrence point, and to develop a regenerative scheme which leads to simple proofs of the ergodic theorem, existence and uniqueness of stationary measures.
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
Cited by
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Probability: Theory and Examples
Durrett, R. (2019) · doi:10.1017/9781108591034 · Cited by 857
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Konda, V. R., & Tsitsiklis, J. N. (2003) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012901385691 · Cited by 709
Metadata
- Authors
- Athreya, K. B., & Ney, P.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1978
- Volume
- 245
- Issue
- 0
- Pages
- 493-501
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W2076430891
- Cited by
- 412
- References
- 0
- FWCI
- 3.66
- 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: A new approach to the limit theory of recurrent Markov chains. https://app.cochat.ai/papers/10.1090/s0002-9947-1978-0511425-0
- The paper
- Athreya, K. B., & Ney, P. (1978). A new approach to the limit theory of recurrent Markov chains. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1978-0511425-0
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.