Efficient random number generation for sojourn times in semi-Markov processes

71 Views Asked by At

I'm doing a self-study of semi-Markov processes and was wondering if there are efficient methods for generating random numbers for sojourn times. For example, generating a bunch of random numbers from a given distribution might be faster than generating a single random number at each step, especially for distributions that are more expensive than the usual exponential/geometric.