The DOI matches its Crossref record.
Markov chain concepts related to sampling algorithms
Abstract
Theorem 3.1 If X is positive recurrent and aperiodic then its stationary distribution ,r(.) is the unique probability distribution satisfying {3.1}. We then say that X is ergodic and the following consequences hold: More sophisticated estimation procedures based on regenerative techniques are discussed in Tierney (1995: this volume).
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
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Bayesian human segmentation in crowded situations
Zhao, T., & Nevatia, R. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211503 · Cited by 294
Estimation and Inference via Bayesian Simulation: An Introduction to Markov Chain Monte Carlo
Jackman, S. (2000) · American Journal of Political Science · doi:10.2307/2669318 · Cited by 254
Optimizing the Marketing Interventions Mix in Intermediate-Term CRM
Rust, R. T., & Verhoef, P. C. (2005) · Marketing Science · doi:10.1287/mksc.1040.0107 · Cited by 191
Bayesian Multilevel Analysis and MCMC
Draper, D. (2007) · Handbook of Multilevel Analysis · doi:10.1007/978-0-387-73186-5_2 · Cited by 69
Metadata
- Venue
- Markov Chain Monte Carlo in Practice
- Publisher
- Chapman and Hall/CRC
- Published
- 1995-12-01
- Pages
- 63-76
- OpenAlex
- W3000312518
- Cited by
- 311
- References
- 0
- FWCI
- 19.02
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Markov chain concepts related to sampling algorithms. https://app.cochat.ai/papers/10.1201/b14835-8
- The paper
- Markov chain concepts related to sampling algorithms. (1995). Markov Chain Monte Carlo in Practice. https://doi.org/10.1201/b14835-8
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.
