How to couple from the past using a read-once source of randomness
From MaRDI portal
Publication:4943355
DOI<85::AID-RSA6>3.0.CO;2-H 10.1002/(SICI)1098-2418(200001)16:1<85::AID-RSA6>3.0.CO;2-HzbMath0952.60072arXivmath/9910050OpenAlexW2073299436MaRDI QIDQ4943355
Publication date: 4 January 2001
Full work available at URL: https://arxiv.org/abs/math/9910050
coupling from the pastperfect sampling algorithmsPASTA-type theoremsPoisson arrivals see time average
Related Items
A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling., On the simulation of Markov chain steady-state distribution using CFTP algorithm, Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo, Perfect simulation of steady-state Markov chain on mixed state space, Correlation decay for hard spheres via Markov chains, Nonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques, Polynomial time approximate or perfect samplers for discretized Dirichlet distribution, Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past, One-shot CFTP; application to a class of truncated Gaussian densities, Probability and algorithmics: a focus on some recent developments, Slice sampling. (With discussions and rejoinder), Exact sampling for intractable probability distributions via a Bernoulli factory, Computational issues for perfect simulation in spatial point patterns., Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers, Likelihood-based inference for Matérn type-III repulsive point processes, Unnamed Item, Monotonic multigamma coupling for perfect sampling, Exact Monte Carlo simulation for fork-join networks, Perfect Simulation for Image Restoration, Efficiency test of pseudorandom number generators using random walks, Doeblin trees, Criticality of measures on 2-d Ising configurations: from square to hexagonal graphs, A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability, Parallel simulation of two-dimensional Ising models using probabilistic cellular automata, Perfect Forward Simulation via Simulated Tempering, Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm, Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- An interruptible algorithm for perfect sampling via Markov chains
- Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- On Arrivals That See Time Averages
- Poisson Arrivals See Time Averages
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Perfect Simulation of Conditionally Specified Models
- Exact Sampling from a Continuous State Space
- Iterated Random Functions
- Exact sampling from anti‐monotone systems
- Perfect simulation and backward coupling∗
- Fast convergence of the Glauber dynamics for sampling independent sets
- Stationarity detection in the initial transient problem
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Extensions of Fill's Algorithm for Perfect Simulation
- On Exact Simulation of Markov Random Fields Using Coupling from the Past
- Shuffling biological sequences
