The famous Propp and Wilson (Random Structures and Algorithms 9: 223–252, 1996, Journal of the American Statistical Association 90: 558–566, 1998) protocol called coupling from the past (CFTP) allows exact sampling from steady-state distribution of a Markov chain. When the Markov chain is stiff (i.e. existence of rarely visited states), CFTP spends a prohibitive time to reach stationarity. To reduce this time we propose to combine the variance reduction technique Importance Sampling (IS) with CFTP. Also we propose another technique, based on the power of the Markov chain kernel, to reduce the CFTP simulation time in standard case. When the period δ of the simulated Markov chain is greater than one ( δ > 1), the stopping condition of CFTP is not satisfied. To break the deadlock of CFTP in this case, we propose to transform the studied chain on δ subchains that are aperiodic and for which CFTP can be applied. Some numerical examples are presented to bring the utility of the proposed simulation techniques.
Contents
-
Requires Authentication UnlicensedOn the simulation of Markov chain steady-state distribution using CFTP algorithmLicensedAugust 19, 2009
-
Requires Authentication UnlicensedThe exponential-normal form and its application to ultra high energy cascades investigationLicensedAugust 19, 2009
-
Requires Authentication UnlicensedOn importance sampling in the problem of global optimizationLicensedAugust 19, 2009
-
Requires Authentication UnlicensedBayesian and non-Bayesian analysis of mixed-effects PK/PD models based on differential equationsLicensedAugust 19, 2009
-
Requires Authentication UnlicensedCorrection of a proof in “A probabilistic result on the discrepancy of a hybrid-Monte Carlo sequence and applications”LicensedAugust 19, 2009