Bounding mean first passage times in population continuous-time Markov chains

From MaRDI portal
Publication:2056989

DOI10.1007/978-3-030-59854-9_13zbMATH Open1486.60093arXiv1910.12562OpenAlexW3106672525MaRDI QIDQ2056989FDOQ2056989


Authors: Michael Backenköhler, Luca Bortolussi, Verena Wolf Edit this on Wikidata


Publication date: 8 December 2021

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1910.12562




Recommendations





Cited In (10)





This page was built for publication: Bounding mean first passage times in population continuous-time Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056989)