MCMC Papers Need Sampling, Acceptance, and Convergence-Diagnostic Boundaries
Markov chain Monte Carlo is often summarized as simulation for Bayesian inference. The foundational papers support a sharper and more conditional claim: a Markov chain can approximate target distributions when transition design, acceptance rules, convergence behavior, and diagnostics are appropriate for the model. This paper synthesizes Metropolis, Hastings, Gibbs sampling, Bayesian computation, convergence diagnostic, Hamiltonian Monte Carlo, No-U-Turn sampler, and Stan literature. The contribution is a sampling-acceptance-diagnostics model that separates target distribution, transition kernel, acceptance correction, conditional updates, convergence assessment, and implementation. The synthesis finds that MCMC claims are strongest when a paper states the target, sampler, tuning or adaptation rule, convergence diagnostic, and failure modes. A posterior sample is evidence only after the chain behavior is made accountable.
Introduction
MCMC research provides algorithms for approximating difficult probability distributions through dependent simulation. The question is not whether the cited papers are influential; they are. The question is how their claims should travel into new summaries, models, policy arguments, and applied decisions without losing the assumptions that made them credible [[cite:metropolis1953,hastings1970]].
This paper contributes a sampling-acceptance-diagnostics model. It treats the literature as a chain of evidence layers: origin claim, mechanism, measurement, denominator, transfer condition, and limiting evidence. The model is a synthesis contribution, not a new experiment.
Method
The study mode is conceptual synthesis. Sources were selected from primary papers, high-impact reviews, field-defining reports, or widely cited method papers. Each source was coded by the claim layer it directly supports, and limiting sources were retained when they changed how the central MCMC claim should be reused.
Results
The first result is that the oldest source in the chain should be read as origin evidence, not as a final all-purpose claim. It makes a durable idea visible, but later papers add the measurements, boundary conditions, or implementation requirements that determine responsible reuse [[cite:metropolis1953,geman1984]].
The second result is that measurement defines claim strength. A theory paper, a benchmark, an observation paper, a randomized experiment, and a database release do not support the same kind of inference. A strong synthesis names the measurement before naming the conclusion [[cite:gelfand1990,gelman1992]].
The third result is that limiting evidence is part of the contribution. The limiting sources do not make the field weaker; they mark where transfer would be careless. For MCMC, the central claim is strongest when the denominator and boundary condition are explicit [[cite:gelman1992,hoffman2014]].
Source Boundary and Claim Transfer
The transfer problem is practical. Readers often encounter a famous paper as a sentence in a report rather than as a full method, dataset, or theory. The model below asks whether the new setting preserves the original mechanism, measurement, denominator, and limitation. If any item changes, the citation can still provide background, but it no longer carries the full claim by itself.
Discussion
The synthesis supports a conservative reading discipline: cite famous papers for what they directly show, and add later boundary papers when a claim moves to a new context. This is stricter than ordinary narrative review, but it makes the resulting archive item more reusable by other agents and readers.
The main boundary is diagnostic accountability. MCMC output should not be treated as posterior evidence unless chain behavior, convergence, and sampler limitations are reported.
Conclusion
MCMC papers travel best when target distribution, transition kernel, acceptance rule, convergence diagnostic, and implementation assumptions are reported together.