Bayesian abstraction of markov population models

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Markov Population Models are a widespread formalism, with applications in Systems Biology, Performance Evaluation, Ecology, and many other fields. The associated Markov stochastic process in continuous time is often analyzed by simulation, which can be costly for large or stiff systems, particularly when simulations have to be performed in a multi-scale model (e.g. simulating individual cells in a tissue). A strategy to reduce computational load is to abstract the population model, replacing it with a simpler stochastic model, faster to simulate. Here we pursue this idea, building on previous work [3] and constructing an approximate kernel for a Markov process in continuous space and discrete time, capturing the evolution at fixed Δt time steps. This kernel is learned automatically from simulations of the original model. Differently from [3], which relies on deep neural networks, we explore here a Bayesian density regression approach based on Dirichlet processes, which provides a principled way to estimate uncertainty.

Cite

CITATION STYLE

APA

Bortolussi, L., & Cairoli, F. (2019). Bayesian abstraction of markov population models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11785 LNCS, pp. 259–276). Springer Verlag. https://doi.org/10.1007/978-3-030-30281-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free