Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,541,793 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.
2017
2017
On the Coupling Time of the Heat-Bath Process for the Fortuin–Kasteleyn Random–Cluster Model
A. Collevecchio
,
E. Elçi
,
T. Garoni
,
M. Weigel
2017
Corpus ID: 49367316
We consider the coupling from the past implementation of the random–cluster heat-bath process, and study its random running time…
Expand
2015
2015
Fast perfect simulation of Vervaat perpetuities
K. Cloud
,
M. Huber
Journal of Complexity
2015
Corpus ID: 15977594
2014
2014
Perfect sampling for closed queueing networks
A. Bouillard
,
Ana Bušić
,
Christelle Rovetta
Performance evaluation (Print)
2014
Corpus ID: 16165634
2010
2010
A novel approach for the simulation of power quality stationary disturbances in electric power systems
A. Pavas
,
H. Torres-Sanchez
,
A. Delgadillo
International Conference on Harmonics and Quality…
2010
Corpus ID: 6228837
This paper presents a method for calculation of stationary Power Quality Disturbances-PQD based on measurements, distribution…
Expand
2009
2009
PERFECT SIMULATION OF SPATIAL POINT PROCESSES USING DOMINATED COUPLING FROM THE PAST WITH APPLICATION TO A MULTISCALE AREA-INTERACTION POINT PROCESS
G. Ambler
,
Bernard Walter Silverman
2009
Corpus ID: 16812783
We consider perfect simulation algorithms for locally stable point processes based on dominated coupling from the past. A new…
Expand
2008
2008
Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past
E. Peköz
,
S. Ross
Journal of Applied Probability
2008
Corpus ID: 7968596
We give a new method for simulating the time average steady-state distribution of a continuous-time queueing system, by extending…
Expand
2006
2006
Exact sampling with highly uniform point sets
C. Lemieux
,
Paul Sidorsky
Mathematical and computer modelling
2006
Corpus ID: 38956756
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
Highly Cited
1999
Highly Cited
1999
Perfect simulation in stochastic geometry
W. Kendall
,
E. Thönnes
Pattern Recognition
1999
Corpus ID: 14599277
1999
1999
Exact and Approximate Sampling from the Stationary Distribution of a Markov Chain
M. Schneider
1999
Corpus ID: 41491744
When simulating a physical system with discrete sates, one often would like to generate a sample from the stationary distribution…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required