In this paper, we introduce a new Markov chain Monte Carlo approach to Bayesian analysis of discretely observed diffusion processes. We treat the paths between any two data points as missing data. As such, we show that, because of full dependence between the missing paths and the volatility of the diffusion, the rate of convergence of basic algorithms can be arbitrarily slow if the amount of the augmentation is large. We offer a transformation of the diffusion which breaks down dependency between the transformed missing paths and the volatility of the diffusion. We then propose two efficient Markov chain Monte Carlo algorithms to sample from the posterior‐distribution of the transformed missing observations and the parameters of the diffusion. We apply our results to examples involving simulated data and also to Eurodollar short‐rate data.
No takes yet. Share an insight, caveat, or question.
Gareth O. Roberts (2001) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: