Efficient sampling of conditioned Markov jump processes
From MaRDI portal
Abstract: We consider the task of generating draws from a Markov jump process (MJP) between two time-points at which the process is known. Resulting draws are typically termed bridges and the generation of such bridges plays a key role in simulation-based inference algorithms for MJPs. The problem is challenging due to the intractability of the conditioned process, necessitating the use of computationally intensive methods such as weighted resampling or Markov chain Monte Carlo. An efficient implementation of such schemes requires an approximation of the intractable conditioned hazard/propensity function that is both cheap and accurate. In this paper, we review some existing approaches to this problem before outlining our novel contribution. Essentially, we leverage the tractability of a Gaussian approximation of the MJP and suggest a computationally efficient implementation of the resulting conditioned hazard approximation. We compare and contrast our approach with existing methods using three examples.
Recommendations
- Bayesian inference for Markov jump processes with informative observations
- scientific article; zbMATH DE number 6378055
- Markov chain Monte Carlo inference for Markov jump processes via the linear noise approximation
- Markov Bridges, Bisection and Variance Reduction
- Analysis of Markov jump processes under terminal constraints
Cites work
- A numerical study of large sparse matrix exponentials arising in Markov chains.
- A theory of the term structure of interest rates
- Alive SMC\(^{2}\): Bayesian model selection for low-count time series models with intractable likelihoods
- Approximation and inference methods for stochastic biochemical kinetics -- a tutorial review
- Automatic Selection of Methods for Solving Stiff and Nonstiff Systems of Ordinary Differential Equations
- Bayesian inference for hybrid discrete-continuous stochastic kinetic models
- Bayesian inference for Markov jump processes with informative observations
- Birth/birth-death processes and their computable transition probabilities with biological applications
- Efficient \(\mathrm{SMC}^2\) schemes for stochastic kinetic models
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Exact and approximate Bayesian inference for low integer-valued time series models with intractable likelihoods
- Exact estimation for Markov chain equilibrium expectations
- Guided proposals for simulating multi-dimensional diffusion bridges
- scientific article; zbMATH DE number 6378055 (Why is no real title available?)
- scientific article; zbMATH DE number 3786561 (Why is no real title available?)
- scientific article; zbMATH DE number 2106098 (Why is no real title available?)
- scientific article; zbMATH DE number 3206712 (Why is no real title available?)
- Improved bridge constructs for stochastic differential equations
- Inference for Diffusion Processes
- Inference for reaction networks using the linear noise approximation
- Markov chain Monte Carlo inference for Markov jump processes via the linear noise approximation
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Point processes and queues. Martingale dynamics
- Sequential Bayesian inference in hidden Markov stochastic kinetic models with application to detection and response to seasonal epidemics
- Simple simulation of diffusion bridges with application to likelihood inference for diffusions
- Simulation of conditioned diffusion and application to parameter estimation
- Simulation of Multivariate Diffusion Bridges
- Simulation-based Bayesian inference for epidemic models
- Solutions of ordinary differential equations as limits of pure jump markov processes
- Stochastic modeling of aphid population growth with nonlinear, power-law dynamics
- Stochastic modelling for systems biology.
- The alive particle filter and its use in particle Markov chain Monte Carlo
- Unbiased Bayesian inference for population Markov jump processes via random truncations
Cited in
(14)- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Analysis of Markov jump processes under terminal constraints
- Direct statistical inference for finite Markov jump processes via the matrix exponential
- Bayesian inference for Markov jump processes with informative observations
- scientific article; zbMATH DE number 6378055 (Why is no real title available?)
- Perfect sampling for nonhomogeneous Markov chains and hidden Markov models
- scientific article; zbMATH DE number 3901881 (Why is no real title available?)
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Accelerating inference for stochastic kinetic models
- On predictive inference for intractable models via approximate Bayesian computation
- Stochastic filtering of reaction networks partially observed in time snapshots
- A novel method and comparison of methods for constructing Markov bridges
- Guided simulation of conditioned chemical reaction networks
- Distance-reducing Markov bases for sampling from a discrete sample space
This page was built for publication: Efficient sampling of conditioned Markov jump processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329829)
