Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution

Details Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution

2009-10-09

arxiv.org/abs/0910.1683v1

Annals of Applied Statistics 2009, Vol. 3, No. 3, 1204-1231

Statistics

Applications

Published in at http://dx.doi.org/10.1214/09-AOAS247 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Ins

Scientific paper

10.1214/09-AOAS247

Analyses of serially-sampled data often begin with the assumption that the observations represent discrete samples from a latent continuous-time stochastic process. The continuous-time Markov chain (CTMC) is one such generative model whose popularity extends to a variety of disciplines ranging from computational finance to human genetics and genomics. A common theme among these diverse applications is the need to simulate sample paths of a CTMC conditional on realized data that is discretely observed. Here we present a general solution to this sampling problem when the CTMC is defined on a discrete and finite state space. Specifically, we consider the generation of sample paths, including intermediate states and times of transition, from a CTMC whose beginning and ending states are known across a time interval of length $T$. We first unify the literature through a discussion of the three predominant approaches: (1) modified rejection sampling, (2) direct sampling, and (3) uniformization. We then give analytical results for the complexity and efficiency of each method in terms of the instantaneous transition rate matrix $Q$ of the CTMC, its beginning and ending states, and the length of sampling time $T$. In doing so, we show that no method dominates the others across all model specifications, and we give explicit proof of which method prevails for any given $Q,T,$ and endpoints. Finally, we introduce and compare three applications of CTMCs to demonstrate the pitfalls of choosing an inefficient sampler.

Affiliated with

Also associated with

No associations

Rating

Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51019