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

DOI10.1007/978-3-030-59854-9_13zbMath1486.60093arXiv1910.12562OpenAlexW3106672525MaRDI QIDQ2056989

Verena Wolf, Luca Bortolussi, Michael Backenköhler

Publication date: 8 December 2021

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

zbMATH Keywords

semi-definite programmingexit time distributionMarkov population modelspopulation continuous-time Markov chainsreachability probability

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (1)

Optimal Bayesian estimation of Gaussian mixtures with growing number of components

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