Estimation of state-transition probability matrices in asynchronous population Markov processes

We address the problem of estimating the probability transition matrix of an asynchronous vector Markov process from aggregate (longitudinal) population observations. This problem is motivated by estimating phenotypic state transitions probabilities in populations of biological cells, but can be ext...

Full description

Bibliographic Details
Main Authors: Farahat, Waleed A. (Contributor), Asada, Harry (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mechanical Engineering (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2013-02-06T18:58:23Z.
Subjects:
Online Access:Get fulltext
LEADER 01572 am a22001933u 4500
001 76753
042 |a dc 
100 1 0 |a Farahat, Waleed A.  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Mechanical Engineering  |e contributor 
100 1 0 |a Farahat, Waleed A.  |e contributor 
100 1 0 |a Asada, Harry  |e contributor 
700 1 0 |a Asada, Harry  |e author 
245 0 0 |a Estimation of state-transition probability matrices in asynchronous population Markov processes 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2013-02-06T18:58:23Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/76753 
520 |a We address the problem of estimating the probability transition matrix of an asynchronous vector Markov process from aggregate (longitudinal) population observations. This problem is motivated by estimating phenotypic state transitions probabilities in populations of biological cells, but can be extended to multiple contexts of populations of Markovian agents. We adopt a Bayesian estimation approach, which can be computationally expensive if exact marginalization is employed. To compute the posterior estimates efficiently, we use Monte Carlo simulations coupled with Gibb's sampling techniques that explicitly incorporate sampling constraints from the desired distributions. Such sampling techniques can attain significant computational advantages. Illustration of the algorithm is provided via simulation examples. 
546 |a en_US 
655 7 |a Article 
773 |t Proceedings of the American Control Conference (ACC), 2010