Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,986,999 papers from all fields of science
Search
Sign In
Create Free Account
Coupling from the past
Among Markov chain Monte Carlo (MCMC) algorithms, coupling from the past is a method for sampling from the stationary distribution of a Markov chain…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
List of numerical analysis topics
Markov chain
Markov chain Monte Carlo
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Perfect Sampling of graph k-colorings for k>3Δ
S. Bhandari
,
Sayan Chakraborty
arXiv.org
2019
Corpus ID: 202719026
We give an algorithm for perfect sampling from the uniform distribution on proper $k$-colorings of graphs of maximum degree…
Expand
Review
2017
Review
2017
MARKOV CHAINS AND COUPLING FROM THE PAST
Dylan Cordaro
2017
Corpus ID: 21690811
We aim to explore Coupling from the Past (CFTP), an algorithm designed to obtain a perfect sampling from the stationary…
Expand
Review
2016
Review
2016
Advances in MCMC Methods with Applications to Particle Filtering, DSMC, and Bayesian Networks
D. Jennings
2016
Corpus ID: 29157433
Markov Chain Monte Carlo (MCMC) methods are a class of algorithms for sampling from a desired probability distribution. While…
Expand
2014
2014
Notes on “ Coupling from the Past ”
Michael Y. Hu
2014
Corpus ID: 17092812
The goal of a Markov Chain Monte Carlo (MCMC) simulation is to generate samples from a target probability distribution π by…
Expand
2011
2011
Methods for checking coupling from the past
Mikael Wennlund
2011
Corpus ID: 57266504
Sometimes one wants a sample from an unknown distribution. We call a realization, without any errors, of a random variable with…
Expand
2011
2011
A Non-commutative Version of the Coupling from the Past Algorithm
N. Sissouno
2011
Corpus ID: 54161832
We discuss the Coupling from the Past Algorithm within the context of synchronising words and reformulate it. Our findings are…
Expand
2008
2008
An Algorithm of Coupling from the Past with Directional Threshold
Linfeng Shen
,
Haihui Wang
,
Shiyin Qin
International Symposium on Computer Science and…
2008
Corpus ID: 15370756
This paper proposed a new algorithm of Coupling from the Past (CFTP) with directional threshold. CFTP, also called Exact Sampling…
Expand
2006
2006
Markov Chain Monte Carlo Methods Lecture 7 : September 12 , 2006 Coupling from the Past Eric Vigoda
Eric Vigoda
2006
Corpus ID: 17143561
We saw in the last lecture how Markov chains can be useful algorithmically. If we have a probability distribution we’d like to…
Expand
Review
1998
Review
1998
Exact sampling for Bayesian inference : towards general purpose algorithms
J. Bernardo
,
J. Berger
,
A. Dawid
,
A. F. Smith
,
Peter J. Green
,
Duncan Murdoch
1998
Corpus ID: 15084516
There are now methods for organising a Markov chain Monte Carlo simulation so that it can be guaranteed that the state of the…
Expand
1998
1998
E cient Use of Exact
SamplesbyDuncan
,
J. Murdoch
,
J. S. Rosenthal
1998
Corpus ID: 16238989
Propp and Wilson (1996,1998) described a protocol called coupling from the past (CFTP) for exact sampling from the steady-state…
Expand