Log In Sign Up

Analysis of Markov Jump Processes under Terminal Constraints

by   Michael Backenköhler, et al.

Many probabilistic inference problems such as stochastic filtering or the computation of rare event probabilities require model analysis under initial and terminal constraints. We propose a solution to this bridging problem for the widely used class of population-structured Markov jump processes. The method is based on a state-space lumping scheme that aggregates states in a grid structure. The resulting approximate bridging distribution is used to iteratively refine relevant and truncate irrelevant parts of the state-space. This way the algorithm learns a well-justified finite-state projection yielding guaranteed lower bounds for the system behavior under endpoint constraints. We demonstrate the method's applicability to a wide range of problems such as Bayesian inference and the analysis of rare events.


Abstraction-Guided Truncations for Stationary Distributions of Markov Population Models

To understand the long-run behavior of Markov population models, the com...

An integer grid bridge sampler for the Bayesian inference of incomplete birth-death records

A one-to-one correspondence is established between the bridge path space...

Recency-weighted Markovian inference

We describe a Markov latent state space (MLSS) model, where the latent s...

Adaptive Bayesian Inference of Markov Transition Rates

Optimal designs minimize the number of experimental runs (samples) neede...

Sequential Lifted Bayesian Filtering in Multiset Rewriting Systems

Bayesian Filtering for plan and activity recognition is challenging for ...

Special Function Methods for Bursty Models of Transcription

We explore a Markov model used in the analysis of gene expression, invol...