Perfect sampling from independent Metropolis-Hastings chains
DOI10.1016/S0378-3758(01)00243-9zbMath0999.60068OpenAlexW1981165469MaRDI QIDQ1611778
Jem N. Corcoran, Richard L. Tweedie
Publication date: 28 August 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00243-9
Markov chainsinvariant measurecoupling from the pastMetropolis algorithmsperfect sampling algorithmsHastings algorithmsbackwards coupling
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Renewal theory (60K05)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- 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
- Two ergodicity criteria for stochastically recursive sequences
- Perfect sampling of ergodic Harris chains
- Markov chains for exploring posterior distributions. (With discussion)
- Stochastically recursive sequences and their generalizations
- Rates of convergence of the Hastings and Metropolis algorithms
- Perfect Simulation of Conditionally Specified Models
- Exact Sampling from a Continuous State Space
- Exact sampling from anti‐monotone systems
- Perfect simulation and backward coupling∗
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times
This page was built for publication: Perfect sampling from independent Metropolis-Hastings chains