Skip to main content
Article thumbnail
Location of Repository

AN EFFICIENT MCMC ALGORITHM FOR CONTINUOUS PH DISTRIBUTIONS Ryo Watanabe

By C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, A. M. Uhrmacher, Hiroyuki Okamura and Tadashi Dohi

Abstract

This paper proposes an MCMC (Markov chain Monte Carlo) algorithm for estimating continuous phasetype distributions (CPHs). In Bayes estimation, it is well known that MCMC is one of the most useful and practical methods. The concrete MCMC algorithm for CPHs was developed by using Markov jump processes by Bladt et al. (2003). However, the existing MCMC algorithm spends much computation time in some cases. In this paper, we propose a new sampling algorithm which is based on uniformization technique and backward likelihood computation. The proposed algorithm is easier to implement and is more efficient in terms of computation time than the existing method.

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.3789
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.informs-sim.org/wsc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.