Exact simulation of the jump times of a class of Piecewise Deterministic Markov Processes
arXiv:1602.07871 · doi:10.1007/s10915-017-0607-4
Abstract
In this paper, we are interested in the exact simulation of a class of Piecewise Deterministic Markov Processes (PDMP). We show how to perform efficient thinning algorithms depending on the jump rate bound. For different types of jump rate bounds, we compare theoretically the mean number of generated (total) jump times and we compare numerically the simulation times. We use thinning algorithms on Hodgkin-Huxley models with Markovian ion channels dynamic to illustrate the results.
32 pages, 6 figures
References in corpus (3)
Cited by in corpus (6)
- Exact weight cancellation in Monte Carlo eigenvalue transport problems
- Optimal market making under partial information with general intensities
- Velocity Jumps for Molecular Dynamics
- Extending JumpProcess.jl for fast point process simulation with time-varying intensities
- Load-dependent machine failures in production network models
- Efficient stochastic simulation of gene regulatory networks using hybrid models of transcriptional bursting