Abstract

Abstract The standard Coupling From The Past (CFTP) algorithm is an interesting tool to sample from exact stationary distribution of a Markov chain. But it is very expensive in time consuming for large chains. There is a monotone version of CFTP, called MCFTP, that is less time consuming for monotone chains. In this work, we propose two techniques to get monotone chain allowing use of MCFTP: widening technique based on adding two fictitious states and clustering technique based on partitioning the state space in clusters. Usefulness and efficiency of our approaches are showed through a sample of Markov Chain Monte Carlo simulations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call