Bounding Mean First Passage Times in Population Continuous-Time Markov Chains

10/28/2019
by   Michael Backenköhler, et al.
0

We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population models is notoriously difficult since typically neither state-based numerical approaches nor methods based on stochastic sampling give efficient and accurate results. Here, we propose a technique that extends recently developed methods using semi-definite programming to determine bounds on mean first passage times. We further apply the technique to hybrid models and demonstrate its accuracy and efficiency for some examples from biology.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2022

A Continuous Time Framework for Discrete Denoising Models

We provide the first complete continuous time framework for denoising di...
research
10/17/2022

Forward-Backward Latent State Inference for Hidden Continuous-Time semi-Markov Chains

Hidden semi-Markov Models (HSMM's) - while broadly in use - are restrict...
research
02/11/2022

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains

Verifying quantum systems has attracted a lot of interest in the last de...
research
06/13/2022

A supCBI process with application to streamflow discharge and a model reduction

We propose a new stochastic model for streamflow discharge timeseries as...
research
02/16/2023

MM Algorithms to Estimate Parameters in Continuous-time Markov Chains

Continuous-time Markov chains (CTMCs) are popular modeling formalism tha...
research
07/06/2021

Scaling up Continuous-Time Markov Chains Helps Resolve Underspecification

Modeling the time evolution of discrete sets of items (e.g., genetic mut...

Please sign up or login with your details

Forgot password? Click here to reset