A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability
DOI10.1515/MCMA-2019-2050zbMATH Open1431.60077OpenAlexW2986254338WikidataQ126838022 ScholiaQ126838022MaRDI QIDQ2293281FDOQ2293281
Authors: Abdelaziz Nasroallah, Mohamed Yasser Bounnite 
Publication date: 7 February 2020
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mcma-2019-2050
Recommendations
- Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- A coupling technique for stochastic comparison of functions of Markov processes
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
- A Coupling-Regeneration Scheme for Diagnosing Convergence in Markov Chain Monte Carlo Algorithms
- scientific article; zbMATH DE number 1995728
Computational methods in Markov chains (60J22) Point estimation (62F10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cites Work
- Perfect slice samplers
- Title not available (Why is that?)
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Perfect Samplers for Mixtures of Distributions
- An interruptible algorithm for perfect sampling via Markov chains
- Perfect simulation for a class of positive recurrent Markov chains
- Title not available (Why is that?)
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Exact Sampling from a Continuous State Space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect simulation and backward coupling∗
- How to couple from the past using a read-once source of randomness
- Widening and clustering techniques allowing the use of monotone CFTP algorithm
- Perfect Simulation of Conditionally Specified Models
- On the simulation of Markov chain steady-state distribution using CFTP algorithm
Cited In (3)
This page was built for publication: A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293281)
