Stopping Tests for Markov Chain Monte-Carlo Methods

B. Ycart ()
Additional contact information
B. Ycart: Universite´ Rene´ Descartes

Methodology and Computing in Applied Probability, 2000, vol. 2, issue 1, 23-36

Abstract: Abstract Markov Chain Monte-Carlo methods produce a random sample of a given distribution by simulating a Markov chain for which the desired distribution is a reversible measure. In order to generate a sample of size n, we propose to run n independent copies of the chain all starting from the same initial state. If n is large enough, the cutoff phenomenon yields a natural stopping rule. Indeed, the access to equilibrium can be detected using empirical estimates for the expectation of a state function. The method is illustrated by the generation of random samples of stable sets on an undirected graph.

Keywords: MCMC convergence; stopping tests; cutoff (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1010003117070 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:2:y:2000:i:1:d:10.1023_a:1010003117070

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1023/A:1010003117070

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().